Skip to main content

Factorizations, congruences, and the decomposition of automata and systems

  • Automata Theory
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science (MFCS 1974)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 28))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Birkhoff, G., Lattice Theory, Amer. Math. Soc. Colloq. Pub. 25, New York (1948); revised edition (1960).

    Google Scholar 

  2. Büchi, R. and Wright, J.B., "Mathematical Theory of Automata," unpublished unpublished notes, University of Michigan (1960).

    Google Scholar 

  3. Thatcher, J., "Notes on Mathematical Automata Theory," University of Michigan Technical Note 03105-26-T (1963).

    Google Scholar 

  4. Yeh, R., "A study of general systems using automata theory", Cybernetica 13 No. 3 (1970) 180–194.

    Google Scholar 

  5. Gallaire, H. and Harrison, M., "Decomposition of linear sequential machines," Math. Sys. Th. 3 (1969) 246–287.

    Google Scholar 

  6. Hartmanis, J. and Stearns, R.E., Algebraic Structure Theory of Sequential Machines, Prentice-Hall, New Jersey (1966).

    Google Scholar 

  7. Sipusic, T., "Two Automata Decomposition Theorems Generalized to Machines in a Closed Monoidal Category," Quarterly Report No. 35, Institute for Computer Research, the University of Chicago, Section IID (1972).

    Google Scholar 

  8. Goguen, J.A., Thatcher, J.W., Wagner, E.G., and Wright, J.B., "A junction between computer science and category theory, I: basic concepts and examples (part 1)", Report RC 4526, IBM Watson Research Center, New York (1973).

    Google Scholar 

  9. MacLane, S. and Birkhoff, G., Algebra, MacMillan, New York (1967).

    Google Scholar 

  10. MacLane, S., Category Theory for the Working Mathematician, Springer-Verlag, New York (1971).

    Google Scholar 

  11. Birkhoff, G., "On the structure of abstract algebras", Proc. of the Cambridge Phil, Soc. 31 (1935) 433–454.

    Google Scholar 

  12. Goguen, J.A., "Minimal realization of machines in closed categories" Bull. of the Amer. Math. Soc. 78 No. 5 (1972) 777–783.

    Google Scholar 

  13. Arbib, M.A., and Manes, E.G., "Foundations of system theory: decompressible systems" Automatica (May 1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Blikle

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B. (1975). Factorizations, congruences, and the decomposition of automata and systems. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_665

Download citation

  • DOI: https://doi.org/10.1007/3-540-07162-8_665

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07162-4

  • Online ISBN: 978-3-540-37492-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics