Title
On The Descriptional Complexity Of Lindenmayer Systems
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.
Year
DOI
Venue
2004
10.1142/S0129054104002674
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Keywords
DocType
Volume
Lindenmayer systems, syntactic measures of complexity, succintness of descriptions
Conference
15
Issue
ISSN
Citations 
4
0129-0541
4
PageRank 
References 
Authors
0.66
4
1
Name
Order
Citations
PageRank
Jürgen Dassow1530118.27