Skip to main content
Conference Proceedings

Acceptance conditions for ω-languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7410 LNCS 320-331
DOI: 10.1007/978-3-642-31653-1_29
2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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 (nin f, ∏), (nin f, ⊆) and (nin f, =) is given. The final section provides a partial characterization of (fin, =). © 2012 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Dennunzio, A., Formenti, E., & Provillard, J. (2012). Acceptance conditions for ω-languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7410 LNCS, pp. 320–331). https://doi.org/10.1007/978-3-642-31653-1_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free