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

DOI10.1016/J.IC.2008.03.011zbMATH Open1154.68065OpenAlexW2021777532MaRDI QIDQ948077FDOQ948077

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

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

zbMATH Keywords

Lindenmayer systemsdescriptional complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• A simultaneous reduction of several measures of descriptional complexity in scattered context grammars
• Extension of tabled 0L-systems and languages
• Title not available (Why is that?)
• The degree of parallelism
• A three-restricted normal form theorem for ETOL languages
• Title not available (Why is that?)
• ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
• Title not available (Why is that?)
• Active symbols in pure systems
• A study in parallel rewriting systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• TOL systems and languages

Cited In (2)

• Title not available (Why is that?)
• 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)