Conditional Lindenmayer systems with subregular conditions: The non-extended case

Abstract

We consider conditional tabled Lindenmayer sytems without interaction, where each table is associated with a regular set and a table can only be applied to a sentential form which is contained in its associated regular set. We study the effect to the generative power, if we use instead of arbitrary regular languages only finite, nilpotent, monoidal, combinational, definite, ordered, union-free, star-free, strictly locally testable, commutative regular, circular regular, and suffix-closed regular languages. Essentially, we prove that the hierarchy of language families obtained from conditional Lindenmayer systems with subregular conditions is almost identical to the hierarchy of families of subregular languages.

Conditional Lindenmayer Systems with Subregular Conditions: The Extended Case

“…In [5] the systematic study of conditional Lindenmayer systems where the languages associated to the tables belong to some family of subregular languages was started. In [5], the case of non-extended Lindenmayer systems was investigated. In this paper we continue by the consideration of extended conditional Lindenmayer systems with subregular conditions.…”