On correspondences between unary algebras, automata, semigroups and congruences

Algebra Colloquium

Volumn 13, Issue 3, 2006, Pages 495-506

  Petkovic T ^a   Ciric M ^b   Bogdanovic S ^b  

^a NOKIA RESEARCH CENTER   (United States)

^b UNIVERSITY OF NI   (Serbia)

Author keywords

Automata; Pseudovarieties; Regular identities; Unary algebras; Varieties

Indexed keywords

EID: 33745468980     PISSN: 10053867     EISSN: None     Source Type: Journal    
DOI: 10.1142/S1005386706000447     Document Type: Article

References (16)

1. J. Almeida, On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics, Algebra Universalis 27 (1990) 333-350.
2. C.J. Ash, Pseudovarieties, generalized varieties and similarly described classes, J. Algebra 92 (1985) 104-115.
3. S. Burris, H.P. Sankappanavar, A Course in Universal Algebra, Springer-Verlag, New York, 1981.
4. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York-London, Vol. A, 1974;
5. Automata, Languages and Machines Vol.B, 1976.
6. F. Gécseg, I. Peák, Algebraic Theory of Automata, Akadémiai Kiadó, Budapest, 1972.
7. T. Petković, M. Ćirić, S. Bogdanović, Decompositions of automata and transition semigroups, Acta Cybernetica (Szeged) 13 (1998) 385-403.
8. T. Petković, M. Ćirić, S. Bogdanović, Characteristic semigroups of directable automata, in: Proc. DLT (2002), Lect. Notes in Comput. Sci., 2450, 2003, pp. 417-428.
9. T. Petković, M. Ćirić, S. Bogdanović, Unary algebras, semigroups and congruences on free semigroups, Theoret. Comput. Sci. 324 (1) (2004) 87-105.
10. J.-E. Pin, A variety theorem without complementation, Izvestiya VUZ Matematika 39 (1995) 80-90.
11. S. Salehi, Varieties of tree languages definable by syntactic monoids, Acta Cybernetica 17 (2005) 21-41.
12. M.P. Schützenberger, On finite monoids having only trivial subgroups, Inf. Control 8 (1965) 190-194.
13. M. Steinby, A theory of tree language varieties, in: Tree Automata and Languages, eds. M. Nivat, A. Podelski, Elsevier, Amsterdam, 1992, pp. 57-81.
14. M. Steinby, Classifying regular languages by their syntactic algebras, in: Results and Trends in Theoretical Computer Science (Graz, 1994), Lect. Notes in Comput. Sci., 812, Springer, Berlin, 1994, pp. 396-409.
15. M. Steinby, General varieties of tree languages, Theoret. Comput. Sci. 205 (1998) 1-43.
16. D. Thérien, Classification of regular languages by congruences, Rep. CS-80-19, University of Waterloo, Department of Computer Science, Waterloo, Ontario, 1980.