Title
On the descriptional complexity of some variants of lindenmayer systems
Abstract
We define the number of productions and the number of symbols as complexity measures for interactionless Lindenmayer systems with a completely parallel derivation process and for some variants of limited Lindenmayer systems with a partially parallel derivation process and for the associated languages. We prove that up to an initial part any natural number can occur as complexity of some language. Moreover, we show the existence of languages with small descriptional complexity with respect to one mechanism and large complexity with respect to the other device.
Year
Venue
Keywords
2002
Developments in Language Theory
interactionless lindenmayer system,associated language,complexity measure,parallel derivation process,limited lindenmayer system,small descriptional complexity,natural number,large complexity,initial part,lindenmayer system
Field
DocType
Volume
Discrete mathematics,Combinatorics,Natural number,Computer science,L-system
Conference
2450
ISSN
ISBN
Citations 
0302-9743
3-540-40431-7
3
PageRank 
References 
Authors
0.56
8
3
Name
Order
Citations
PageRank
Jürgen Dassow1530118.27
Taishin Nishida230.89
Bernd Reichel361.38