On subdirectly irreducible automata

 Access to full text

 Full (PDF)

1. 1. A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974. Zbl0326.68005MR413592
2. 2. M. A. ARBIB, Theories of Abstract Automata, Englewood Cliffs, N. J., Prentice-Hall Inc., 1969. Zbl0193.32801MR321626
3. 3. G. BIRKHOFF, Lattice Theory, A.M.S., 1968. 
4. 4. G. BIRKHOFF, Subdirect Unions in Universal Algebra, Bull. Amer. Math. Soc., 50, 1944, pp. 764-768. Zbl0060.05809MR10542
5. 5. A.H. CLIFFORD and G. B. PRESTON, The Algebraic Theory of Semigroups, Amer. Math. Soc., 1964. Zbl0111.03403
6. 6. M. DEMLOVÁ, J. DEMEL and V. KOUBEK, Several Algorithms for Finite Algebras, F.C.T., 1979, pp. 99-104. Zbl0426.68020MR563663
7. 7. M. DEMLOVÁ, J. DEMEL and V. KOUBEK, Algorithms Deciding Subdirect Irreducibility of Algebras, to appear. Zbl0426.68020
8. 8. J. HARTMANIS and R. E. STEARNS, Algebraic Structure Theory of Sequential Machines, Englewood Cliffs, N. J., Prentice-Hall Inc., 1966. Zbl0154.41701MR204224
9. 9. B. M. SCHEIN, Embedding of Semigroups in Generalized Groups (russian), Matem. sb., 55, 1961, pp. 397-400. MR139673
10. 10. B. M. SCHEIN, About Transitive Representations of Semigroups (russian), Uspechi matem. nauk, 18 1963, pp. 215-222. 
11. 11. G. THIERRIN, Irreducible Automata, Proc. 25th Summer Meeting of Canadian Math. Congress, 1971, pp. 245-262. Zbl0325.94035MR351685
12. 12. E. J. TULLY, Representation of a Semigroup by Transformations Acting Transitively on a Set, Amer. J. Math., 83, 1961, pp. 533-541. Zbl0116.25504MR136670

1. Marie Demlová, Václav Koubek, Fast diagnosis of some semigroup properties of automata
2. Jiří Demel, Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras