8th Annual Symposium on Switching and Automata Theory (SWAT 1967) (1967)

Texas

Oct. 18, 1967 to Oct. 20, 1967

pp: 296-306

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.1967.7

ABSTRACT

A study is made of the classes of predicates accepted by three types of multitape Turing machine. In order of decreasing acceptance powers, these are the general Turing machine, the Linear-Bounded Automaton, and the multitape two-way nonwriting automaton. Each class is shown to consist of all and only those predicates which can be defined by a corresponding class of predicate calculus formulas based on one-sided catenation with letters, and involving as logical operators conjunction, disjunction, and a type of transitive closure on predicates of 2n variables.

INDEX TERMS

CITATION

N. D. Jones, "Classes of automata and transitive closure,"

*8th Annual Symposium on Switching and Automata Theory (SWAT 1967)(FOCS)*, Texas, 1967, pp. 296-306.

doi:10.1109/FOCS.1967.7

CITATIONS

SEARCH