有限离散Lindenmayer系统的描述复杂性
On the Descriptional Complexity of Limited Propagating Lindenmayer Systems
摘要:
我们研究了有限传播Lindenmayer系统及其确定性和表型变体的相对于规则数和符号数的几何复杂性。我们确定的复杂性降低时,生成能力的增加。对于不可比的家庭,我们给出的语言,可以更有效地描述在这些家庭中的任何一个比在其他。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。