Preview
Unable to display preview. Download preview PDF.
References
Adámek, J., Free algebras and automata realizations in the language of categories, Comment. Math. Univ. Carolinae 15 (1974), 582–602.
Adámek, J., Automaty v teorii kategorií — thesis 1975
Adámek, J., Automata and categories: Finitness contra minimality, this volume, pp. 160–166.
Arbib, M.A. and Manes, E.G, Machines in a category: an expository introduction. SIAM Review 16 (1974), 163–192.
Barr, M., Coequalizers and free triples, Math. Z. 116 (1970), 307–322.
Kůrková-Pohlová, V. and Koubek, V., When a generalized algebraic category is monadic, Comment. Math. Univ. Carolinae 15 (1974), 577–587.
Trnková, V., Adámek, J. Koubek, V. and Reiterman, J., Free algebras, input process and free monads, Comment. Math. Univ. Carolinae 16 (1975), 339–352.
Trnková, V., Automata and categories, this volume, pp. 138–152.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koubek, V., Reiterman, J. (1975). Automata and categories — Input processes. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_209
Download citation
DOI: https://doi.org/10.1007/3-540-07389-2_209
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07389-5
Online ISBN: 978-3-540-37585-2
eBook Packages: Springer Book Archive