MACROS, Iterated Substitution and Lindenmayer AFLs

Open Access
Publisher Website
Google Scholar
Abstract
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.

This publication has 0 references indexed in Scilit: