Cycle-free IN-algebraic systems

  • Werner Kuich
Conference paper
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.

Unable to display preview. Download preview PDF.


  1. [1]
    HARRISON,M.A., Introduction to Formal Language Theory, Addison-Wesley Publ.Comp., 1978.Google Scholar
  2. [2]
    KUICH,W., The Characterization of Parallel Ultralinear Grammars by Rational Power Series, Acta Informatica (to appear).Google Scholar
  3. [3]
    SALOMAA,A. and SOITTOLA,M., Automata-Theoretic Aspects of Formal Power Series, Springer, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Werner Kuich
    • 1
  1. 1.Institut für Mathematische Logik und Formale SprachenTechnische Universität WienWien

Personalised recommendations