Displaying similar documents to “A Finite Axiomatization of Nondeterministic Regular Expressions”

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

Jürgen Dassow, Stefan Rudolf (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

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 definable by Lindström quantifiers

Zoltán Ésik, Kim G. Larsen (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.