DeepAI AI Chat
Log In Sign Up

From n-grams to trees in Lindenmayer systems

by   Diego Gabriel Krivochen, et al.

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.


page 1

page 2

page 3

page 4


Automatic Language Identification System for Hindi and Magahi

Language identification has become a prerequisite for all kinds of autom...

Multilingual Normalization of Temporal Expressions with Masked Language Models

The detection and normalization of temporal expressions is an important ...

Finding Common Ground for Incoherent Horn Expressions

Autonomous systems that operate in a shared environment with people need...

Separator logic and star-free expressions for graphs

We describe two formalisms for defining graph languages, and prove that ...

Efficient Utility-Driven Self-Healing Employing Adaptation Rules for Large Dynamic Architectures

Self-adaptation can be realized in various ways. Rule-based approaches p...

A Set-Theoretic Framework for Parallel Graph Rewriting

We tackle the problem of attributed graph transformations and propose a ...

Towards a classification of Lindenmayer systems

In this paper we will attempt to classify Lindenmayer systems based on p...