Displaying similar documents to “Finite idempotent groupoids and regular languages”

Imre Simon : an exceptional graduate student

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!

On Varieties of Literally Idempotent Languages

Ondřej Klíma, Libor Polák (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

A language is literally idempotent in case that if and only if , for each , . Varieties of literally idempotent languages result naturally by taking all literally idempotent languages in a classical (positive) variety or by considering a certain closure operator on classes of languages. We initiate the systematic study of such varieties. Various classes of literally idempotent languages can be characterized using syntactic methods. A starting example is the class of all finite unions...

Group conjugation has non-trivial LD-identities

Aleš Drápal, Tomáš Kepka, Michal Musílek (1994)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We show that group conjugation generates a proper subvariety of left distributive idempotent groupoids. This subvariety coincides with the variety generated by all cancellative left distributive groupoids.