Equational description of pseudovarieties of homomorphisms

RAIRO - Theoretical Informatics and Applications

Volumn 37, Issue 3, 2003, Pages 243-254

  Kunc, Michal ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Implicit operation; Pseudoidentity; Pseudovariety; Syntactic homomorphism; Variety of regular languages

Indexed keywords

BOOLEAN FUNCTIONS; SET THEORY; THEOREM PROVING;

METRIC MONOIDS;

FORMAL LANGUAGES;

EID: 0344152864     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2003018     Document Type: Article

References (7)

1. J. Almeida, Finite Semigroups and Universal Algebra. World Scientific, Singapore (1995).
2. 1. J. Comput. System Sci. 44 (1992) 478-499.
3. S. Eilenberg, Automata, Languages and Machines. vol. B, Academic Press, New York (1976).
4. J.E. Pin, A variety theorem without complementation. Russian Math. (Iz. VUZ) 39 (1995) 74-83.
5. J. Reiterman, The Birkhoff theorem for finite algebras. Algebra Universalis 14 (1982) 1-10.
6. M.P. Schützenberger, On finite monoids having only trivial subgroups. Inform. and Control 8 (1965) 190-194.
7. H. Straubing, On the logical description of regular languages. in Proc. 5th Latin American Sympos. on Theoretical Informatics (LATIN 2002), edited by S. Rajsbaum, Lecture Notes in Comput. Sci., vol. 2286, Springer, Berlin (2002) 528-538.