Decompositions of automata and transition semigroups

Acta Cybernetica

Volumn 13, Issue 4, 1998, Pages 385-403

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

^a UNIVERSITY OF NI   (Serbia)

Author keywords

Automaton; Direct sum decomposition; Directable automata; Generalized directable automata; Generalized varieties; Locally directable automata; Transition semigroup; Trapped automata

Indexed keywords

EID: 0348166835     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. C. J. Ash, Pseudovarieties, generalized varieties and similarly described classes, J. Algebra 92 (1985), 104-115.
2. I. Babcsányi, Rees automaták, Matematikai Lapok 29 (1977-81), no. 1-3, 139-148 (in Hungarian).
3. I. Babcsányi and A. Nagy, Right-group type automata, Acta Cybernetica 12 (1995), 131-136.
4. S. Bogdanović and M. Ćirić, A note on congruences on algebras, in Proc. of II Math. Conf. in Priština 1996, Lj. D. Kočinac ed., Priština, 1997, pp. 67-72.
5. J. A. Brzozowski, Canonical regular expressions and minimal state graphs for definite events, Proc. Symp. Math. Theory of Automata, Microwave Research Inst. Symp. Ser. 12 (Brooklyn. 1963), New York, 1963, pp. 529-561.
6. S. Burris and H. P. Sankappanavar, A course in universal algebra, Springer Verlag, New York, 1981.
7. J. Černý, Poznámka k homogénym experimentom s konecinými automatami, Mat.-fyz. cas. SAV 14 (1964), 208-215.
8. J. Čorný, A. Pirická and B. Rosenauerová, On directable automata, Kybernetika 7 (1971), no. 4, 289-298.
9. M. Ćirić and S. Bogdanović, Posets of C-congruences, Algebra Universalis 36 (1996), 423-424.
10. M. Ćirić and S. Bogdanović, Lattices of subautomata and direct sum decompositions of automata, Algebra Colloq. (to appear).
11. M. Ćirić, S. Bogdanović and T. Petković, The lattice of positive quasi-orders on an automaton, Facta Umversitatis (Niš) Ser. Math. Inform. 11, (1996), 143-156.
12. M. Ćirić, S. Bogdanović and T. Petković, The lattice of subautomata of an automaton (a brief survey), Proceedings of the Conference LIRA '97, (to appear).
13. P. Dömösi, On temporal products of automata, Papers on Automata and Languages X, Dept. of Math. Karl Marx Univ. of Economics, Budapest, 1988-1, pp. 49-62.
14. F. Gécseg and I. Peák, Algebraic Theory of Automata, Akadémiai Kiadó, Budapest, 1972.
15. A. Ginzburg, About some properties of definite, reverse definite and related automata, IEEE Trans. Electronic Computers EC-15 (1966), 809-810.
16. V. M. Glushkov, Abstract automata and partitions of free semigroups, DAN SSSR 136 (1961), 765-767 (in Russian).
17. J. M. Howie, Fundamentals of Semigroup Theory, London Math. Soc. monographs, New Series, Clarendon Press, Oxford, 1995.
18. B. Imreh and M. Steinby, Some remarks on directable automata, Acta Cybernetica 12, (1995), no. 1, 23-35.
19. M. Ito and J. Duske, On cofinal and definite automata, Acta Cybernetica 6 (1983), no. 2, 181-189.
20. S. C. Kleene, Representation of events in nerve nets and finite automata, Automata Studies, Princeton University Press, Princeton, N.J., 1956, pp. 3-41.
21. W. Lex and R. Wiegandt, Torsion theory for acts, Studia Sci. Math. Hungar. 16 (1981), 263-280.
22. A. Nagy, Boolean type retractable automata with traps, Acta Cybernetica 10 (1991), no. 1-2, 53-64.
23. I. Peák, Automata and semigroups I, Acta Sci. Math. (Szeged) 25 (1964), 193-201 (in Russian).
24. I. Peák, Automata and semigroups II, Acta Sci. Math. (Szeged) 26 (1965), 49-54 (in Russian).
25. M. Perles, M. O. Rabin and E. Shamir, The theory of definite automata, IEEE Trans. Electronic Computers EC-12 (1963), 233-243.
26. J. E. Pin, Sur les mots synchronisants dans un automata fini, Elektron. Inform. Verarb. u. Kybernetik, EIK 14 (1978), 297-303.
27. J. E. Pin, Sur un cas particulier de la conjecture de Cerny, Automata, langagues and programming, ICALP'79 (Proc. Coll., Udine, 1979), Lect. Notes. Comp. Sci. 62, Springer-Verlag, Berlin, 1979, pp. 345-352.
28. J. E. Pin, Variétés de langages formels, Masson, Paris, 1984.
29. L. N. Shevrin, About some classes of abstract automata, Uspehi matem. nauk 17:6 108 (1962), p. 219 (in Russian).
30. P. H. Starke, Abstrakte Automaten, VEB Deutscher Verlag der Wissenschaften, Berlin, 1969.
31. M. Steinby, On definite automata and related systems, Ann. Acad. Sci. Fenn., Ser. A, I. Mathcmatica 444, 1969.
32. 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.