Summary
A notion, of “exit-automaton” is introduced to play a role analogous to “machine scheme” or “program scheme”. Exit-automata and machines are equipped with algebraic structure leading to a simple characterization of their behaviors.
Zusammenfassung
Ein Begriff des „Ausgangs-Automaten“wird eingeführt, welcher eine analoge Rolle zu den Begriffen „Maschinen-Schema“oder „Programm-Schema“spielen soll. Ausgangs-Automaten und Maschinen sind mit einer algebraischen Struktur versehen, die eine einfache Charakterisierung ihres Verhaltens ermöglicht.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Rutledge, J. D.: On Ianov’s Program Schemata. Journal of the Association for Computing Machinery 11, 1 (January, 1964).
Ianov, I. I.: On the Logical Schemata of Algorithms. Problems of Cybernetics 1, 75–127 (1958).
Fels, E. M.: Kaluzhnen Graphs and Ianov Writs in Logik und Logikkalkül. Munich: Verlag Karl Alber. 1962.
Moore, E. F., (editor): Sequential Machines. Addison Wesley. 1964.
Ginsburg, S.: An Introduction to Mathematical Machine Theory. Addison Wesley, 1962.
Böhm, C.: On a Family of Turing Machines and the Related Programming Language. ICC Bulletin 3, 3 (July 1964).
Bohm, C. and G.Jacopini: Flow Diagrams, Turing Machines and Languages with only Two Formation Rules. Presented at 1964. International Colloquium on Algebraic Linguistics and Automata Theory, Jerusalem, Israel.
Glushkov, V. M. and A. A.Letichenskii: Theory of Algorithms and Discrete Processors, in Advances in Information Systems Science. Edited by Julius T. Tou.
MacLane and Birkhoff: Algebra. Macmillan. 1967.
Eilenberg and Wright: Automata in General Algebras. Information and Control. 11, 4 (October, 1967).
Lawvere, F. W.: Functorial Semantics of Algebraic Theories. Proc. of Nat. Acad. of Sciences 50, 5, pp. 869–872 (Nov. 1963).
Elgot, C. C.: The External Behavior of Machines. Proceedings of the Third Hawaii International Conference on System Sciences. 1970.
Rabin and Scott: Finite Automata and Their Decision Problems in [3].
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Elgot, C.C. (1982). The Common Algebraic Structure of Exit-Automata and Machines. In: Bloom, S.L. (eds) Selected Papers. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8177-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8177-8_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-8179-2
Online ISBN: 978-1-4613-8177-8
eBook Packages: Springer Book Archive