Transparent Categories and Categories of Transition Systems

Give’on, Yehoshafat

doi:10.1007/978-3-642-99902-4_14

Yehoshafat Give’on⁵^nAff6

1126 Accesses
1 Citations

Abstract

Several recent results in automata theory (in particular, Hartmanis and Stearns 1964, Zeiger 1964) give evidence of the importance of homomorphisms in the study of transition systems and automata. It is natural therefore to inquire how much information can be retrieved from the algebra of homomorphism compositions with respect to transition systems. The natural mathematical framework for the discussion of this problem is categorical algebra.

This research was supported by the Office of Naval Research under Contract No. Nonr 1224 (21).

Received June 23, 1965.

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

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 39.99; Price excludes VAT (USA)

Softcover Book: USD 54.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

References

Freyd, P.: Abelian categories: An introduction to the theory of functors. Harper’s Series in Modern Mathematics. New York 1964.
Google Scholar
Give’on, Y.: Toward a homological algebra of automata I: The representation and completeness theorem for categories of abstract automata. Technical Report, Department of Communication Sciences, ORA. The University of Michigan 1964.
Google Scholar
— Toward a homological algebra of automata. Technical Report, Department of Communication Sciences, ORA, The University of Michigan 1965.
Google Scholar
Hartmanis, J., and R. E. Stearns: Pair algebra and automata theory. Inform. Control 7, 485–507 (1964).
Article MathSciNet Google Scholar
Kan, D.M.: Adjoint functors. Trans. Amer. Math. Soc. 87, 295–329 (1958).
Google Scholar
MacLane, S.: Categorical algebra. Bull. Amer. Math. Soc. 71, 40–106 (1965).
Article MathSciNet MATH Google Scholar
Zeiger, H. P.: Loop-free synthesis of finite state machines. Thesis, MIT (1964).
Google Scholar

Download references

Author information

Yehoshafat Give’on
Present address: Aiken Computation Laboratory, Harvard University, Cambridge, Massachusetts, USA

Authors and Affiliations

Logic of Computers Group, Department of Communication Sciences, University of Michigan, Ann Arbor, Michigan, USA
Yehoshafat Give’on

Authors

Yehoshafat Give’on
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

Columbia University, Hamilton Hall, New York 27, N. Y., USA
S. Eilenberg
Department of Mathematics, University of Oregon, Eugene, Ore., USA
D. K. Harrison
Department of Mathematics, The University of Chicago, Chicago, Ill., USA
S. MacLane
Department of Mathematics, University of California, San Diego, La Jolla, USA
H. Röhrl

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Give’on, Y. (1966). Transparent Categories and Categories of Transition Systems. In: Eilenberg, S., Harrison, D.K., MacLane, S., Röhrl, H. (eds) Proceedings of the Conference on Categorical Algebra. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-99902-4_14

Download citation

DOI: https://doi.org/10.1007/978-3-642-99902-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-99904-8
Online ISBN: 978-3-642-99902-4
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics