Operators reducing generalized OL-systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)
KeywordsCellular 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.
- 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
- Novotný, M., On some operators reducing generalized grammars. Submitted to Information and Control.Google Scholar
- 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
- Salomaa, A., Formal languages. Academic Press 1973.Google Scholar
© Springer-Verlag Berlin Heidelberg 1974