scientific article; zbMATH DE number 7315103

MaRDI QIDQ4964024zbMATH OpenFDO

Authors Bianca Truthe

Publication date 24 February 2021

Full work available at URL https://arxiv.org/abs/1008.1660, http://eptcs.web.cse.unsw.edu.au/paper.cgi?DCFS2010.20

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
• scientific article; zbMATH DE number 1948492
• On the descriptional complexity of k-uniformly-limited Lindenmayer systems
• A comparison of the descriptional complexity of classes of limited Lindenmayer systems. II
• A comparison of the descriptional complexity of classes of limited Lindenmayer systems. I.
• Descriptional complexity of limited automata
• scientific article; zbMATH DE number 4191133
• scientific article; zbMATH DE number 3982523
• Membrane Computing
• scientific article; zbMATH DE number 1342206

Cited in

(6)

• A comparison of the descriptional complexity of classes of limited Lindenmayer systems. I.
• ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
• ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS
• scientific article; zbMATH DE number 1948492 (Why is no real title available?)
• A comparison of the descriptional complexity of classes of limited Lindenmayer systems. II
• On the descriptional complexity of k-uniformly-limited Lindenmayer systems

This page was built for publication:

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