Comparison of some descriptional complexities of 0L systems obtained by a unifying approach

DOI10.1016/J.IC.2008.03.011zbMath1154.68065OpenAlexW2021777532MaRDI QIDQ948077

Henning Fernau, Juergen Dassow

Publication date: 8 October 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.011

zbMATH Keywords

Lindenmayer systemsdescriptional complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On families of categorial grammars of bounded value, their learnability and related complexity questions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simultaneous reduction of several measures of descriptional complexity in scattered context grammars
• A three-restricted normal form theorem for ETOL languages
• ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
• A study in parallel rewriting systems
• Extension of tabled 0L-systems and languages
• TOL systems and languages

This page was built for publication: Comparison of some descriptional complexities of 0L systems obtained by a unifying approach