ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS

DOI10.1142/S0129054104002674zbMath1067.68080OpenAlexW1989727751MaRDI QIDQ3022027

Juergen Dassow

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054104002674

zbMATH Keywords

Lindenmayer systemssuccintness of descriptionssyntactic measures of complexity

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

A COMPARISON OF THE DESCRIPTIONAL COMPLEXITY OF CLASSES OF LIMITED LINDENMAYER SYSTEMS: PART I ⋮ EDT0L grammars with only one variable have tractable generating functions ⋮ Comparison of some descriptional complexities of 0L systems obtained by a unifying approach ⋮ ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS

Cites Work

• Unnamed Item
• A three-restricted normal form theorem for ETOL languages
• A study in parallel rewriting systems
• Uniform rewriting based on permutations

This page was built for publication: ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS