Previous |  Up |  Next

Article

References:
[1] A. V. Aho J. E. Hopcroft, J. D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesiey, Reading, Mass. 1974. MR 0413592
[2] A. H. Clifford, G. B. Preston: The Algebraic Theory of Semigroups. AMS Providence, Rhode Island 1967. Zbl 0178.01203
[3] M. Demlová J. Demel, V. Koubek: On subdirectly irreducible automata. RAIRO - Inform. Théor. 15 (1981), 23-46. MR 0610944
[4] R. E. Tarjan: Depth first search and linear graph algorithms. SIAM J. Comput. 1 (1971), 146-160. MR 0304178
[5] T. Watanabe, A. Nakamura: On the transformation semigroups of finite automata. J. Comp. System Sci. 26 (1983), 107-138. MR 0699223 | Zbl 0504.68029
[6] T. Watanabe, S. Noguchi: The amalgamation of automata. J. Comp. System Sci. 15 (1977), 1-16. MR 0449938 | Zbl 0357.94058
[7] T. Watanabe, S. Noguchi: Quasi-state independent automata. I.E.C.E. Japan. Trans. 60-D (1977), 177-179.
Partner of
EuDML logo