Mathematical systems theory

, Volume 3, Issue 2, pp 110–118 | Cite as

Remarks on algebraic decomposition of automata

  • A. R. Meyer
  • C. Thompson
Article

Abstract

A version of the Krohn-Rhodes decomposition theorem for finite automata is proved in which capabilities as well as semigroups are preserved. Another elementary proof of the usual Krohn-Rhodes theorem is also presented.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Arbib (ed.),Algebraic Theory of Machines, Languages, and Semigroups, Academic Press, New York, 1968.Google Scholar
  2. [2]
    M. Arbib,Theories of Abstract Automata, Prentice-Hall, Englewood Cliffs, N.J., 1968.Google Scholar
  3. [3]
    A. Ginzburg,Algebraic Theory of Automata, Academic Press, New York, 1968.Google Scholar
  4. [4]
    J. Hartmanis andR. E. Stearns,Algebraic Structure Theory of Sequential Machines, Prentice-Hall, Englewood Cliffs, N.J., 1966.Google Scholar
  5. [5]
    K. Krohn andJ. Rhodes, Algebraic theory of machines, I,Trans. Amer. Math. Soc. 116 (1965), 450–464.Google Scholar
  6. [6]
    A. R. Meyer, A note on star-free events,J. Assoc. Comput. Machinery 16 (1969), 220–225.Google Scholar
  7. [7]
    P. Zeiger, Yet another proof of the cascade decomposition theorem for finite automata,Math. Systems Theory 1 (1967), 225–288.Google Scholar

Copyright information

© Swets & Zeitlinger B.V. 1969

Authors and Affiliations

  • A. R. Meyer
    • 1
  • C. Thompson
    • 1
  1. 1.Carnegie-Mellon UniversityUSA

Personalised recommendations