Abstract
Recently Lindenmayer systems have become a field of extensive study in theoretical informatics [1,2]. In such systems all symbols within a word have to be rewritten simultaneously. In this paper some special context-independent Lindenmayer systems (OL-systems) will be considered. They have to be placed between context-free SemiThue systems and OL-systems. It is assumed that the basic terminology of L-systems is known [1,2,3].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L Systems. Edited by A. Salomaa, G. Rozenberg. Lecture Notes in Computer Science 15, Springer Berlin, Heidelberg, New York 1974
M. Nielsen, G. Rozenberg, A. Salomaa, S. Skyum. Nonterminals, Homomorphisms and Codings in Different Variations of OL—systems. DAIMI PB-21, Aarhus 1974
A. Salomaa. Formal Languages. Academic Press, New York, London 1973
The names of the systems considered are due to a talk with G. Rozenberg
S. Skyum. Parallel Context—free Languages. DAIMI PB-30, Aarhus 1974
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kudlek, M. (1975). Comparing Several Ways of Context-Independent Parallel Rewriting. In: Siefkes, D. (eds) GI-4.Jahrestagung. Lecture Notes in Computer Science, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-40087-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-40087-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-39104-4
Online ISBN: 978-3-662-40087-6
eBook Packages: Springer Book Archive