THE EQUIVALENCE OF RECOGNIZING POWER FOR ONE TYPE OF ALTERNATING ω-FINITE AUTOMATA AND DETERMINISTIC ω-FINITE AUTOMATA

In this paper, one type of alternating ω-finite automata （abbreviated ω-UAFA）,that is, all states of alternating ω-finite automata are universal, is suggested. And by adopting the constructing method, it is shown that the ω-language class accepted by ω-UAFA is equal to the one accepted by deterministic ω-finite automata under four types of acceptance conditions.