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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
