Advertisement

Finite automaton from a flowchart scheme point of view

  • Calvin C. Elgot
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Keywords

Finite Automaton Sequential Machine Label Function Tree Automaton Atomic Substitution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [EM]
    E. F. Moore, "Gedanken-Experiements on Sequential Machines."Google Scholar
  2. [SK]
    S. C. Kleene, "Representation of Events in Nerve Nets and Finite Automata."Google Scholar
  3. [RS]
    M. O. Rabin and D. Scott, "Finite Automata and their Decision Problems."Google Scholar
  4. [DH]
    D. A. Huffman, "The Synthesis of Sequential Switching Circuits."Google Scholar
  5. [BW]
    A. W. Burks and J. B. Wright, "Theory of Logical Nets."Google Scholar
  6. [CE-SP]
    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.Google Scholar
  7. [CE-MT]
    C. C. Elgot, "Matricial theories," IBM Research Report RC-4564, October 1973, to appear in Journal of Algebra 42, No. 2, October 1976.Google Scholar
  8. [EBT]
    C. C. Elgot, S. L. Bloom, R. Tindell, "On the algebraic structure of rooted trees," IBM Report RC 6230, October 1976.Google Scholar
  9. [MS]
    M. P. Schützenberger, "Certain elementary families of automata," Proceedings of Symposium on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn 1962.Google Scholar

Additional Brief Bibliography (the first five are closely related)

  1. [1]
    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.Google Scholar
  2. [2]
    S. L. Bloom, S. Ginali, J. D. Rutledge, "Scalar and vector iteration," IBM Research Report RC-5986, May 1976. (To appear in JCSS)Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    S. Ginali, "Iterative algebraic theories, infinite trees, and program schemata," Dissertation, University of Chicago, June 1976.Google Scholar
  5. [5]
    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).Google Scholar
  6. [6]
    E. Engeler, "Structure and meaning of elementary programs," Symposium on Semantics of Algorithmic Languages Proceedings, pp. 89–101, Springer Verlag 1971.Google Scholar
  7. [7]
    E. G. Manes, Algebraic Theories, Academic Press, 1976.Google Scholar
  8. [8]
    S. Eilenberg, J. B. Wright, "Automata in general algebras," Information and Control 11, pp. 452–470 (1967).CrossRefGoogle Scholar
  9. [9]
    J. Goguen, J. Thatcher, E. Wagner, J. Wright, "Initial algebra semantics and continuous algebras," IBM Research Report RC-5701 (1975). To appear in JACM.Google Scholar
  10. [10]
    M. Wand, "Mathematical foundations of language theory," Dissertation. Project MAC, MIT (1973).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Calvin C. Elgot
    • 1
  1. 1.IBM Thomas J. Watson Research CenterYorktown Heights

Personalised recommendations