A model for a Lindenmayer reconstruction algorithm
Formal Languages and Automata Theory
2019-01-25 v1 Computation and Language
Abstract
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.
Keywords
Cite
@article{arxiv.1901.08407,
title = {A model for a Lindenmayer reconstruction algorithm},
author = {Diego Gabriel Krivochen and Beth Phillips},
journal= {arXiv preprint arXiv:1901.08407},
year = {2019}
}
Comments
Manuscript. Comments welcomed