MACROS, Iterated Substitution and Lindenmayer AFLs
DOI:
https://doi.org/10.7146/dpb.v2i18.6437Abstract
The notion of a K-iteration grammar, where K is a family of languages, provides a uniform framework for discussing the various language families obtained by context-free Lindenmayer systems. It is shown that the family of languages generated by K-iteration grammars possesses strong closure properties under the assumption that K itself has certain weak closure properties. Along these lines, the notion of a hyper-AFL is introduced and some open problems are posed.Downloads
Published
1973-10-01
How to Cite
Salomaa, A. (1973). MACROS, Iterated Substitution and Lindenmayer AFLs. DAIMI Report Series, 2(18). https://doi.org/10.7146/dpb.v2i18.6437
Issue
Section
Articles
License
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.