The Common Algebraic Structure of Exit-Automata and Machines

Die allgemeine algebraische Struktur von Ausgangs-Automaten und Maschinen

Calvin C. Elgot
Additional contact information
Calvin C. Elgot: IBM Thomas J. Watson Research Center

A chapter in Selected Papers, 1982, pp 157-178 from Springer

Abstract: 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.

Keywords: Turing Machine; Partial Function; Algebraic Theory; Finite Sequence; Finite Automaton (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-8177-8_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461381778

DOI: 10.1007/978-1-4613-8177-8_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().