ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
From MaRDI portal
Publication:3022027
DOI10.1142/S0129054104002674zbMath1067.68080MaRDI QIDQ3022027
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
68Q42: Grammars and rewriting systems
Related Items
EDT0L grammars with only one variable have tractable generating functions, Comparison of some descriptional complexities of 0L systems obtained by a unifying approach, A COMPARISON OF THE DESCRIPTIONAL COMPLEXITY OF CLASSES OF LIMITED LINDENMAYER SYSTEMS: PART I, ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS
Cites Work