Conditional Lindenmayer Systems with Subregular Conditions: The Extended Case

Dassow, Jürgen; Rudolf, Stefan

doi:10.14232/actacyb.22.2.2015.5

Cited by 2 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is a strong contrast to conditional grammars, tree controlled grammars, and networks of evolutionary processors, where the corresponding hierarchies differ (for instance, in all cases, star-free, regular suffix-closed, and regular circular languages are as powerful as arbitrary regular languages; moreover, some further different subregular families lead to identical families, if used as regular restriction). In [14], we show that such a situation also holds for extended conditional T0L systems (where in the language are only words over a subset T of the underlying alphabet V ; i.e., the letters from V \ T can be considered as nonterminals).…”

Section: Resultsmentioning

confidence: 89%

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

Dassow

Rudolf²

2014

RAIRO-Theor. Inf. Appl.

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Resultsmentioning

confidence: 89%