Accession Number:

AD0749367

Title:

Finite Tree Automata and omega-Automata.

Descriptive Note:

Technical rept.,

Corporate Author:

MASSACHUSETTS INST OF TECH CAMBRIDGE PROJECT MAC

Personal Author(s):

Report Date:

1972-09-01

Pagination or Media Count:

114.0

Abstract:

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

Subject Categories:

  • Theoretical Mathematics
  • Bionics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE