TY - JOUR
T1 - Theories of automata on ω-tapes
T2 - A simplified approach
AU - Choueka, Yaacov
PY - 1974/4
Y1 - 1974/4
N2 - Using a combinatorial lemma on regular sets, and a technique of attaching a control unit to a parallel battery of finite automata, a simple and transparent development of McNaughton's theory of automata on ω-tapes is given. The lemma and the technique are then used to give an independent and equally simple development of Büchi's theory of nondeterministic automata on these tapes. Some variants of these models are also studied. Finally a third independent approach, modelled after a simplified version of Rabin's theory of automata on infinite trees, is developed.
AB - Using a combinatorial lemma on regular sets, and a technique of attaching a control unit to a parallel battery of finite automata, a simple and transparent development of McNaughton's theory of automata on ω-tapes is given. The lemma and the technique are then used to give an independent and equally simple development of Büchi's theory of nondeterministic automata on these tapes. Some variants of these models are also studied. Finally a third independent approach, modelled after a simplified version of Rabin's theory of automata on infinite trees, is developed.
UR - http://www.scopus.com/inward/record.url?scp=0016048965&partnerID=8YFLogxK
U2 - 10.1016/S0022-0000(74)80051-6
DO - 10.1016/S0022-0000(74)80051-6
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0016048965
SN - 0022-0000
VL - 8
SP - 117
EP - 141
JO - Journal of Computer and System Sciences
JF - Journal of Computer and System Sciences
IS - 2
ER -