In this paper we present two approaches to Lindenmayer systems: the rule-based (or generative) approach, which focuses on L-systems as Thue rewriting systems and a constraint-based (or model-theoretic) approach, in which rules are abandoned in favour of conditions over allowable expressions in the language (Pullum, 2019). We will argue that it is possible, for at least a subset of L-systems and the languages they generate, to map string admissibility conditions (the 'Three Laws') to local tree admissibility conditions (cf. Rogers, 1997). This is equivalent to defining a model for those languages. We will work out how to construct structure assuming only superficial constraints on expressions, and define a set of constraints that well-formed expressions of specific L-languages must satisfy. We will see that L-systems that other methods distinguish turn out to satisfy the same model.
翻译:在本文中,我们提出林登迈耶系统的两个办法:基于规则(或基因化)的方法,侧重于L-系统,作为图文改写系统和基于约束(或模式理论)的方法,其中放弃规则,以优于语言中允许表达的条件(Pullum, 2019年),我们认为,至少对一组L-系统及其产生的语言而言,可以将可接受性条件(“三个法律”)与当地树的可接受性条件(参见Rogers,1997年)相挂钩,这相当于为这些语言确定一个模式。我们将研究如何建立结构,假设仅对表达方式的表面限制,并界定一套特定L-语言的完善表达方式必须满足的制约。我们将看到,其他方法区分出来的L-系统能够满足相同的模式。