Finite Tree Automata and omega-Automata.
MASSACHUSETTS INST OF TECH CAMBRIDGE PROJECT MAC
Pagination or Media Count:
Chapter 1 is a survey of finite automata as acceptors of finite labeled trees. Chapter 2 is a survey of finite automata as acceptors of infinite strings on a finite alphabet. Also considered are several new automata models based on a notion of a run of a finite automaton on an infinite string. M. O. Rabin has published two solutions of the emptiness problem for finite automata operating on infinite labeled trees. Author
- Theoretical Mathematics