Finite Tree Automata and W-Automata
Name
MIT-LCS-TR-102.pdf
Size
2.71 MB
Format
Adobe PDF
Checksum (MD5)
e6f2fdf33e53f1381f791aece8256ae0
Author(s)
Hossley, Robert
Date Issued
September 1972
Series/Report no.
MIT-LCS-TR-102
MAC-TR-102
Abstract
Chapter I is a survey of finite automata as acceptors of finite labeled trees. Chapter II is a survey of finite automata as acceptors of infinite strings on a finite alphabet. Among the automata models considered in Chapter II are those used by McNaughton, Buchi, and Landweber. In Chapter II we also consider several new automata models based on a notion of a run of a finite automataton on an infinite string suggested by Professor A.R. Meyer in private communication. We show that these new models are all equivalent to various previously formulated models.
Persistent DSpace Link
