Infinity problems and countability problems for ω-automata

Authors:
Yunfeng Tao
Affiliations:
BASICS Lab, Department of Computer Science and Engineering, Shanghai Jiao Tong University, China
Venue:
Information Processing Letters
Year:
2006

Citing 4
Cited 0

Invited talk: automata theory for database theoreticians

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Languages, automata, and logic

Handbook of formal languages, vol. 3
Automatic Structures

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
ω-automata

Automata logics, and infinite games

Quantified Score

Hi-index	0.89

Visualization

Abstract

The infinity problem for ω-automata is to decide if the ω-language recognized by a given automaton is infinite; the countability problem is to decide if a given automaton recognizes a countable ω-language. We prove that these problems are NLogspace-complete for (nondeterministic) Büchi, generalized Büchi, Muller, Rabin and parity automata.