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

DOI10.1016/J.IC.2008.03.011MaRDI QIDQ948077zbMATH OpenOpenAlexFDO

Authors Henning Fernau, Jürgen 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)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 1600182 (Why is no real title available?)
• scientific article; zbMATH DE number 3856431 (Why is no real title available?)
• scientific article; zbMATH DE number 3529421 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 1948492 (Why is no real title available?)
• scientific article; zbMATH DE number 1747441 (Why is no real title available?)
• A simultaneous reduction of several measures of descriptional complexity in scattered context grammars
• A study in parallel rewriting systems
• A three-restricted normal form theorem for ETOL languages
• Active symbols in pure systems
• Extension of tabled 0L-systems and languages
• ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
• TOL systems and languages
• The degree of parallelism

Cited in

(2)

• scientific article; zbMATH DE number 5788680 (Why is no real title available?)
• On families of categorial grammars of bounded value, their learnability and related complexity questions

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

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