On the Krohn-Rhodes cascaded decomposition theorem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6200 LNCS, Issue , 2010, Pages 260-278

  Maler, Oded ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTIVE PROOF; DECOMPOSITION THEOREMS; DETERMINISTIC AUTOMATA;

DOMAIN DECOMPOSITION METHODS; ROBOTS; THEOREM PROVING; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 77955034602     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13754-9_12     Document Type: Conference Paper

References (16)

1. Eilenberg, S.: Automata, Languages, and Machines. Academic Press, London (1976)
2. Ginzburg, A.: Algebraic Theory of Automata. Academic Press, London (1968)
3. Hartmanis, J., Stearns, R.E.: Algebraic Structure Theory of Sequential Machines. Prentice- Hall, Englewood Cliffs (1966)
4. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
5. Krohn, K., Rhodes, J.: Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines. Transactions of the American Mathematical Society 116, 450-464 (1965)
6. Lichtenstein, O., Pnueli, A., Zuck, L.D.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.193, pp. 196-218. Springer, Heidelberg (1985)
7. Maler, O., Pnueli, A.: Tight bounds on the complexity of cascaded decomposition of automata. In: FOCS, pp. 672-682 (1990)
8. Maler, O., Pnueli, A.: On the cascaded decomposition of automata, its complexity and its application to logic. Unpublished manuscript (1994), http://www-verimag.imag.fr/∼maler/Papers/decomp.pdf
9. McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)
10. Meyer, A.R.: A note on star-free events. J. ACM 16(2), 220-225 (1969)
11. Pin, J.-E.: Varieties of Formal Languages. Plenum, New York (1996)
12. Rhodes, J.L., Krohn, K.: Algebraic theory of machines. In: Proc. Symp. on Math. Theory of Automata. Polytechnic Press, Brooklyn (1962)
13. Schützenberger, M.-P.: On finite monoids having only trivial subgroups. Information and Control 8(2), 190-194 (1965)
14. Yoeli, M.: Decomposition of finite automata. Technical Report TR-10, US Office of Naval Research, Information Systems Branch, Hebrew University, Jerusalem (1963)
15. Zeiger, H.P.: Cascade synthesis of finite-state machines. Information and Control 10(4), 419-433 (1967)
16. Zeiger, H.P.: Yet another proof of the cascade decomposition theorem for finite automata. Mathematical Systems Theory 1(3), 225-228 (1967)