A model for a Lindenmayer reconstruction algorithm
Given an input string s and a specific Lindenmayer system (the so-called Fibonacci grammar), we define an automaton which is capable of (i) determining whether s belongs to the set of strings that the Fibonacci grammar can generate (in other words, if s corresponds to a generation of the grammar) and, if so, (ii) reconstructing the previous generation.
Code (0)
등록된 구현이 없습니다.
Tasks
modelSimilar Papers 제목 키워드 기반
Towards L-System Captioning for Tree Reconstruction
This work proposes a novel concept for tree and plant reconstruction by directly inferring a Lindenmayer-System (L-System) word representation from image data in an image captioning approach. We train a model end-to-end …
Image CaptioningTowards a classification of Lindenmayer systems
In this paper we will attempt to classify Lindenmayer systems based on properties of sets of rules and the kind of strings those rules generate. This classification will be referred to as a parametrization of the L-space…
ClassificationGeneral ClassificationTechniques for Inferring Context-Free Lindenmayer Systems With Genetic Algorithm
Lindenmayer systems (L-systems) are a formal grammar system, where the most notable feature is a set of rewriting rules that are used to replace every symbol in a string in parallel; by repeating this process, a sequence…
From n-grams to trees in Lindenmayer systems
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…
Optimal L-Systems for Stochastic L-system Inference Problems
This paper presents two novel theorems that address two open problems in stochastic Lindenmayer-system (L-system) inference, specifically focusing on the construction of an optimal stochastic L-system capable of generati…