Displaying 1701 – 1720 of 2555

Showing per page

Regular, inverse, and completely regular centralizers of permutations

Janusz Konieczny (2003)

Mathematica Bohemica

For an arbitrary permutation σ in the semigroup T n of full transformations on a set with n elements, the regular elements of the centralizer C ( σ ) of σ in T n are characterized and criteria are given for C ( σ ) to be a regular semigroup, an inverse semigroup, and a completely regular semigroup.

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.

Currently displaying 1701 – 1720 of 2555