Operators reducing generalized OL-systems

  • Miroslav Novotný
Friday Morning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)


Cellular Automaton Formal Language Complete Characterization Generalize Grammar Free Monoid 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Lindenmayer, A., Developmental systems without cellular interactions, their languages and grammars. J. theor. Biol. 30 (1971), 455–484.PubMedGoogle Scholar
  2. [2]
    Lindenmayer, A., Cellular automata, formal languages and developmental systems. Proceedings of the Fourth International Congress for Logic, Methodology and Philosophy of Science, Bucharest, Romania, 1971.Google Scholar
  3. [3]
    Novotný, M., On some operators reducing generalized grammars. Submitted to Information and Control.Google Scholar
  4. [4]
    Novotný, M., Constructions of grammars for formal languages. Mathematical foundations of computer science. Proceedings of symposium and summer school. High Tatras, September 3–8, 1973, 125–133.Google Scholar
  5. [5]
    Salomaa, A., Formal languages. Academic Press 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Miroslav Novotný
    • 1
  1. 1.Branch BrnoMathematical Institute of the Czechoslovak Academy of SciencesCzechoslovakia

Personalised recommendations