On ywo-way, two-tape automata
Two-way, two-tape automata were first considered in Rabin and Scott . We show how surprisingly powerful these machines are by describing some programming techniques that can be implemented on them, and by proving, by means of these techniques, that there exists a universal two-symbol, two-way, two-tape automaton. We then argue that in contradiction to an assertion by Rabin and Scott, the class of sets of pairs of tapes definable by two-way, two-tape automata is not closed under most Boolean operations.
KeywordsComputational Mathematic Boolean Operation Programming Technique
Unable to display preview. Download preview PDF.
- M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125. Also in:Sequential Machines (ed. E. F. Moore), Addison-Wesley, Reading, Mass., 1964.Google Scholar
- J. McCarthy, Review of ,Math. Reviews 21, 1960, # 2559.Google Scholar
- T. H. Crowley, Review of ,IRE Trans. Electronic Computers 8 (1959), 407.Google Scholar
- C. C. Elgot, Review of ,J. Symbolic Logic 25 (1960), 163–164.Google Scholar