A comparison of the descriptional complexity of classes of limited Lindenmayer systems. I.

DOI10.1142/S0129054112400072MaRDI QIDQ2909185zbMATH OpenOpenAlexFDO

Authors Ronny Harbich, Bianca Truthe

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)

Recommendations

• scientific article; zbMATH DE number 7315103
• A comparison of the descriptional complexity of classes of limited Lindenmayer systems. II
• On the descriptional complexity of \(k\)-uniformly-limited Lindenmayer systems
• ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
• scientific article; zbMATH DE number 1948492

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

Cited in

(6)

• Comparison of some descriptional complexities of 0L systems obtained by a unifying approach
• ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
• A comparison of the descriptional complexity of classes of limited Lindenmayer systems. II
• On the descriptional complexity of \(k\)-uniformly-limited Lindenmayer systems
• scientific article; zbMATH DE number 7315103 (Why is no real title available?)
• scientific article; zbMATH DE number 1948492 (Why is no real title available?)

This page was built for publication: A comparison of the descriptional complexity of classes of limited Lindenmayer systems. I.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909185)