Descriptional complexity of lindenmayer systems


S. Turaev, G. Mavlankulov, M. Othman, and M. H. Selamat




In this paper we study the nonterminal complexity of Lindenmayer systems with respect to tree controlled grammars. We show that all 0L, D0L and E0L languages can be generated by tree controlled grammars with at most five nonterminals. The results based on the idea of using a tree controlled grammar in the t-normal form, which has the one active nonterminal, and a coding homomorphism.


Full Text: PDF