Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Regular languages definable by Lindström quantifiers

Zoltán ÉsikKim G. Larsen — 2003

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

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.

Regular languages definable by Lindström quantifiers

Zoltán ÉsikKim G. Larsen — 2010

RAIRO - Theoretical Informatics and Applications

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.

Page 1

Download Results (CSV)