A COMPARISON OF THE DESCRIPTIONAL COMPLEXITY OF CLASSES OF LIMITED LINDENMAYER SYSTEMS: PART I

DOI10.1142/S0129054112400072zbMath1279.68156OpenAlexW2079372969MaRDI QIDQ2909185

Bianca Truthe, Ronny Harbich

Publication date: 30 August 2012

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

Full work available at URL: https://doi.org/10.1142/s0129054112400072

zbMATH Keywords

Lindenmayer systemsdescriptional complexitylimited rewritingminimality of descriptionspropagating systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive complexity and finite models (68Q19)

Cites Work

• ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
• On the relations between the degree of synchronization and the degree of nondeterminism ink-limited and uniformlyk-limited tol systems

This page was built for publication: A COMPARISON OF THE DESCRIPTIONAL COMPLEXITY OF CLASSES OF LIMITED LINDENMAYER SYSTEMS: PART I