Languages recognized by programs over the two-element monoid.
Gerard Lallement (1989)
Semigroup forum
Similarity:
Gerard Lallement (1989)
Semigroup forum
Similarity:
Lila Kari, Gabriel Thierrin (1995)
Collectanea Mathematica
Similarity:
Johannes Arz (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Kimmo L. Rosenthal (1997)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
Artur Barkhudaryan (2011)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
The clone of a topological space is known to have a strictly more expressive first-order language than that of the monoid of continuous self-maps. The current paper studies coclones of topological spaces (i.e. clones in the category dual to that of topological spaces and continuous maps) and proves that, in contrast to clones, the first-order properties of coclones cannot express anything more than those of the monoid, except for the case of discrete and indiscrete spaces.
Zoltán Ésik, Kim G. Larsen (2003)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et 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.
Denis Thérien (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
This short note reviews the main contributions of the Ph.D. thesis of Imre Simon. His graduate work had major impact on algebraic theory of automata and thirty years later we are in a good position to appreciate how sensitive he was in selecting good problems, and how clever in solving them!
Michal Kunc (2003)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The notion of pseudovarieties of homomorphisms onto finite monoids was recently introduced by Straubing as an algebraic characterization for certain classes of regular languages. In this paper we provide a mechanism of equational description of these pseudovarieties based on an appropriate generalization of the notion of implicit operations. We show that the resulting metric monoids of implicit operations coincide with the standard ones, the only difference being the actual interpretation...