Unary algebras, semigroups and congruences on free semigroups

Theoretical Computer Science

Volumn 324, Issue 1, 2004, Pages 87-105

  Petković, Tatjana ^a,b   Ćirić, Miroslav ^b   Bogdanović, Stojan ^b  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^b UNIVERSITY OF NI   (Serbia)

Author keywords

Automata; Congruences; Semigroups; Unary algebras; Varieties

Indexed keywords

ALGEBRA; AUTOMATA THEORY; COMPOSITION; COMPUTER PROGRAMMING LANGUAGES; MAPPING; SET THEORY;

AUTOMATA; CONGRUENCES; SEMIGROUPS; UNARY ALGEBRAS; VARIETIES;

COMPUTER SCIENCE;

EID: 4344700349     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.054     Document Type: Conference Paper

References (17)

1. Almeida J. On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics. Algebra Universalis. 27:1990;333-350.
2. Ash C.J. Pseudovarieties, generalized varieties and similarly described classes. J. Algebra. 92:1985;104-115.
3. S. Bogdanović, M. Ćirić, A note on congruences on algebras, in: Lj.D. Kočinac (Ed.), Proc. Second Math. Conf. in Priština 1996, Priština, 1997, pp. 67-72.
4. S. Bogdanović, B. Imreh, M. Ćirić, T. Petković, Directable automata and their generalizations - a survey, in: S. Crvenković, I. Dolinka (Eds.), Proc. Seventh Int. Conf. on Algebra and Logic, Novi Sad, 1998, Novi Sad J. Math. 29 (2) (1999) 31-74.
5. S. Bogdanović, B. Imreh, M. Ćirić, T. Petković, Directable automata and their generalizations - a survey, in: S. Crvenković, I. Dolinka (Eds.), Proc. Seventh Int. Conf. on Algebra and Logic, Novi Sad, 1998, Novi Sad J. Math. 29 (2) (1999) 31-74.
6. Burris S., Sankappanavar H.P. A Course in Universal Algebra. 1981;Springer, New York.
7. Denecke K. Hyperequational theory. Math. Japon. 47(2):1998;333-356.
8. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, London, Vol. A, 1974, vol. B, 1976.
9. Gécseg F., Peák I. Algebraic Theory of Automata. 1972;Akadémiai Kiadó Budapest.
10. J.M. Howie, Fundamentals of Semigroup Theory, London Math. Soc. Monographs, New Series, Clarendon Press, Oxford, 1995.
11. Petković T., Ćirić M., Bogdanović S. Decompositions of automata and transition semigroups. Acta Cybernetica (Szeged). 13:1998;385-403.
12. Pin J.-E. A variety theorem without complementation. Izvestiya VUZ Matematika. 39:1995;80-90. (in Russian).
13. Płonka J. On the lattice of varieties of unary algebras. Simon Stevin. 59(4):1985;353-364.
14. Schützenberger M.P. On finite monoids having only trivial subgroups. Inform. and Control. 8:1965;190-194.
15. M. Steinby, Classifying regular languages by their syntactic algebras, in: Results and Trends in Theoretical Computer Science (Graz, 1994), Lecture Notes in Computer Science 812, Springer, Berlin, 1994, 396-409.
16. Tamura T. Maximal or greatest homomorphic images of given type. Canad. J. Math. 20:1968;264-271.
17. D. Thérien, Classification of regular languages by congruences, Rep. CS-80-19, University of Waterloo, Department of Computer Science, Waterloo, Ontario, 1980.