ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS

DOI10.1142/S0129054111007976zbMath1213.68345MaRDI QIDQ3076615

Juergen Dassow, György Vaszil

Publication date: 23 February 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

Lindenmayer systemsdescriptional complexityefficiency of descriptionactive symbol

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Active symbols in grammars with valuations ⋮ EDT0L grammars with only one variable have tractable generating functions

Cites Work

• Unnamed Item
• Concise description of finite languages
• A three-restricted normal form theorem for ETOL languages
• ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
• A study in parallel rewriting systems
• Uniform rewriting based on permutations

This page was built for publication: ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS