Acceptance conditions for omega-languages and the Borel hierarchy
(1310.5032)Abstract
This paper investigates acceptance conditions for finite automata recognizing omega-regular languages. As a first result, we show that, under any acceptance condition that can be defined in the MSO logic, a finite automaton can recognize at most omega-regular languages. Starting from this, the paper aims at classifying acceptance conditions according to their expressive power and at finding the exact position of the classes of omega-languages they induced according to the Borel hierarchy. A new interesting acceptance condition is introduced and fully characterized. A step forward is also made in the understanding of the expressive power of (fin, =).
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.