Displaying 121 – 140 of 339

Showing per page

Regular languages definable by Lindström quantifiers

Zoltán Ésik, Kim 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 Ésik, Kim 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.

Regular permutation sets and loops

Rita Capodaglio (2003)

Bollettino dell'Unione Matematica Italiana

Two suitable composition laws are defined in a regular permutation set in order to find new characterizations of some important classes of loops.

Currently displaying 121 – 140 of 339