On the Descriptional Complexity of Limited Propagating Lindenmayer Systems
Bianca Truthe
Electronic Proceedings in Theoretical Computer Science · 2010
doi:10.4204/eptcs.31.20 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their deterministic and tabled variants with respect to the number of rules and the number of symbols. We determine the decrease of complexity when the generative capacity is increased. For incomparable families, we give languages that can be described more efficiently in either of these families than in the other.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.