Languajes and monoids with disjuntive identity.
Lila Kari, Gabriel Thierrin (1995)
Collectanea Mathematica
Similarity:
Displaying similar documents to “Relational monoids, multirelations, and quantalic recognizers”
Languajes and monoids with disjuntive identity.
Hotz-isomorphism theorems in formal language theory
Volker Diekert, Axel Möbus (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Regular languages definable by Lindström quantifiers
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.
A note on connections between 0L-languages and context-free languages
Jiří Pik (1979)
Kybernetika
Similarity:
Automata and categories
Symeon Bozapalides, Anestis Firarides (1982)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
On a subclass of context-free groups
Thomas Herbst (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Syntactic congruences and syntactic algebras
Johannes Arz (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: