On the Descriptional Complexity of Limited Propagating Lindenmayer Systems

Details On the Descriptional Complexity of Limited Propagating Lindenmayer Systems On the Descriptional Complexity of Limited Propagating Lindenmayer Systems

2010-08-10

arxiv.org/abs/1008.1660v1

EPTCS 31, 2010, pp. 177-188

Computer Science

Formal Languages and Automata Theory

In Proceedings DCFS 2010, arXiv:1008.1270

Scientific paper

10.4204/EPTCS.31.20

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.

Affiliated with

Also associated with

No associations

Rating

On the Descriptional Complexity of Limited Propagating Lindenmayer Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Descriptional Complexity of Limited Propagating Lindenmayer Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Descriptional Complexity of Limited Propagating Lindenmayer Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-583294