Lindenmayer Systems with Control by Ideals and Codes
Jürgen Dassow · Journal of automata, languages and combinatorics · 2020
In a conditional tabled Lindenmayer system, any table $P$ is associated with a regular set $R(P)$, and $P$ is only applicable to a sentential form $x$ if $x\in R(P)$. We study the effect on the generative power if we use regular (right and left) ideals and (special) regular codes instead of arbitrary regular languages.