ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS-Reference-Cited by-同舟云学术

ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS

Published:2004-08 Issue:04 Volume:15 Page:663-672
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

DASSOW JÜRGEN¹

Affiliation:

1. Otto-von-Guericke-Universiät Magdeburg, Fakultät für Informatik, PSF 4120, D-39016 Magdeburg, Germany

Abstract

We define the number of productions and the number of symbols as measures of descriptional complexity for tabled interactionless Lindenmayer systems and their special cases. We investigate the decrease of the descriptional complexities if we go from a family to another one which has a larger generative capacity.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054104002674

Reference11 articles.

1. H. Bordihn and J. Dassow, Developments in Language Theory, A note on the degree of nondeterminism, eds. G. Rozenberg and A. Salomaa (World Scientific, Singapore, 1994) pp. 70–79.

2. On the Descriptional Complexity of Some Variants of Lindenmayer Systems

3. Grammars with Controlled Derivations

4. Descriptional complexity (of languages) a short survey

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. EDT0L grammars with only one variable have tractable generating functions;RAIRO - Theoretical Informatics and Applications;2023

2. A COMPARISON OF THE DESCRIPTIONAL COMPLEXITY OF CLASSES OF LIMITED LINDENMAYER SYSTEMS: PART I;International Journal of Foundations of Computer Science;2012-01

3. ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS;International Journal of Foundations of Computer Science;2011-01

4. On the Descriptional Complexity of Limited Propagating Lindenmayer Systems;Electronic Proceedings in Theoretical Computer Science;2010-08-07

5. Comparison of some descriptional complexities of 0L systems obtained by a unifying approach;Information and Computation;2008-09