This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Classes of automata and transitive closure
Texas
October 18-October 20
ASCII Text
x 
 
Neil D. Jones, "Classes of automata and transitive closure," Foundations of Computer Science, IEEE Annual Symposium on, pp. 296-306, 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), 1967.
 
 
BibTex
x
 
@article{ 10.1109/FOCS.1967.7,
author = {Neil D. Jones},
title = {Classes of automata and transitive closure},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1967},
isbn = {},
pages = {296-306},
doi = {http://doi.ieeecomputersociety.org/10.1109/FOCS.1967.7},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - Classes of automata and transitive closure
SN -
SP296
EP306
A1 - Neil D. Jones,
PY - 1967
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
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.
Citation:
Neil D. Jones, "Classes of automata and transitive closure," focs, pp.296-306, 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), 1967
Usage of this product signifies your acceptance of the Terms of Use.