Acceptance conditions for ω-languages

Authors:
Alberto Dennunzio;Enrico Formenti;Julien Provillard
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano---Bicocca, Milano, Italy;Laboratoire I3S, Université Nice-Sophia Antipolis, Sophia Antipolis, France;Laboratoire I3S, Université Nice-Sophia Antipolis, Sophia Antipolis, France
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 7
Cited 0

Accepting conditions for automata on &ohgr;-languages

Theoretical Computer Science
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
Finite acceptance of infinite words

Theoretical Computer Science
&ohgr;-languages

Handbook of formal languages, vol. 3
Infinite sequences and finite machines

SWCT '63 Proceedings of the 1963 Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design
The Büchi complementation saga

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates acceptance conditions for finite automata recognizing ω-regular languages. Their expressive power and their position w.r.t. the Borel hierarchy is also studied. The full characterization for the conditions (ninf,⊓), (ninf,⊆) and (ninf,=) is given. The final section provides a partial characterization of (fin,=).