Cycle-free IN-algebraic systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 104)
An IN-algebraic system inducing a cycle-free context-free grammar has a strong solution. This solution is unique if the coefficients of ɛ are equal to those of the strong solution.
Unable to display preview. Download preview PDF.
- HARRISON,M.A., Introduction to Formal Language Theory, Addison-Wesley Publ.Comp., 1978.Google Scholar
- KUICH,W., The Characterization of Parallel Ultralinear Grammars by Rational Power Series, Acta Informatica (to appear).Google Scholar
- SALOMAA,A. and SOITTOLA,M., Automata-Theoretic Aspects of Formal Power Series, Springer, 1978.Google Scholar
© Springer-Verlag Berlin Heidelberg 1981