This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. F. Moore, "Gedanken-Experiements on Sequential Machines."
S. C. Kleene, "Representation of Events in Nerve Nets and Finite Automata."
M. O. Rabin and D. Scott, "Finite Automata and their Decision Problems."
D. A. Huffman, "The Synthesis of Sequential Switching Circuits."
A. W. Burks and J. B. Wright, "Theory of Logical Nets."
C. C. Elgot, "Structured programming with and without GO TO statements," IBM Research Report RC-5626, September 1975, also IEEE Trans on Software Eng. SE-2, No. 1, March 1976. Erratum and Corrigendum IEEE Trans. on Software Eng. September 1976.
C. C. Elgot, "Matricial theories," IBM Research Report RC-4564, October 1973, to appear in Journal of Algebra 42, No. 2, October 1976.
C. C. Elgot, S. L. Bloom, R. Tindell, "On the algebraic structure of rooted trees," IBM Report RC 6230, October 1976.
M. P. Schützenberger, "Certain elementary families of automata," Proceedings of Symposium on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn 1962.
Additional Brief Bibliography (the first five are closely related)
S. L. Bloom, C. C. Elgot, "The existence and construction of free iterative theories," IBM Research Report RC-4937, July 1974, also JCSS 12, No. 3, June 1976.
S. L. Bloom, S. Ginali, J. D. Rutledge, "Scalar and vector iteration," IBM Research Report RC-5986, May 1976. (To appear in JCSS)
C. C. Elgot, "Monadic computation and iterative algebraic theories," IBM Research Report RC-4564, October 1973, also in Logic Colloquium '73, Vol. 80, Studies in Logic, H. E. Rose and J. C. Shepherdson, Ed., North Holland 1975.
S. Ginali, "Iterative algebraic theories, infinite trees, and program schemata," Dissertation, University of Chicago, June 1976.
C. C. Elgot, "The external behavior of machines," Proceedings of Third Int'l Conf. on System Sciences (1970), also IBM Research Report RC-2740 (December 1969).
E. Engeler, "Structure and meaning of elementary programs," Symposium on Semantics of Algorithmic Languages Proceedings, pp. 89–101, Springer Verlag 1971.
E. G. Manes, Algebraic Theories, Academic Press, 1976.
S. Eilenberg, J. B. Wright, "Automata in general algebras," Information and Control 11, pp. 452–470 (1967).
J. Goguen, J. Thatcher, E. Wagner, J. Wright, "Initial algebra semantics and continuous algebras," IBM Research Report RC-5701 (1975). To appear in JACM.
M. Wand, "Mathematical foundations of language theory," Dissertation. Project MAC, MIT (1973).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elgot, C.C. (1977). Finite automaton from a flowchart scheme point of view. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_126
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_126
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive