Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources
An extended conditional tabled Lindenmayer systems is an ET0L systems where each table is associated with a regular set, the so-called condition. A table can only be applied to a sentential form if the form belongs to its associated regular set. We study the power of conditional ET0L systems if the conditions are given by regular languages with a limited state or nonterminal complexity. We show that conditions obtained by regular grammars with two nonterminals and finite automata with three states are sufficient to generate all recursively enumerable languages. Similar results are given for the generation of all context-sensitive languages. Moreover, in the non-extended case, one gets infinite hierarchies for both complexity measures.
KeywordsRegular Language Sentential Form Contextual Grammar Regular Grammar Enumerable Language
Unable to display preview. Download preview PDF.
- 3.Dassow, J.: Grammars with commutative, circular, and locally testable conditions. In: Automata, Formal Languages, and Related Topics - Dedicated to Ferenc Gécseg on the occasion of his 70th birthday, University of Szeged, 27–37 (2009)Google Scholar
- 4.Dassow, J., Hornig, H.: Conditional grammars with subregular conditions. In: Proc. Internat. Conf. Words, Languages and Combinatorics II, World Scientific Singapore, 71–86 (1994)Google Scholar
- 8.Dassow, J., Rudolf, St.: Conditional Lindenmayer systems with subregular conditions: the extended case. SubmittedGoogle Scholar