# Beyond $\omega$-Regular Languages

Abstract : The paper presents some automata and logics on $\omega$-words, which capture all $\omega$-regular languages, and yet still have good closure and decidability properties.
keyword :
Document type :
Conference papers
Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.11-16, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science
Domain :

Cited literature [8 references]

https://hal.inria.fr/inria-00456113
Contributor : Publications Loria <>
Submitted on : Friday, February 19, 2010 - 3:05:05 PM
Last modification on : Friday, February 19, 2010 - 3:26:03 PM
Document(s) archivé(s) le : Friday, June 18, 2010 - 6:27:06 PM

### File

bojanczyk.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : inria-00456113, version 1

### Citation

Mikolaj Bojanczyk. Beyond $\omega$-Regular Languages. Jean-Yves Marion and Thomas Schwentick. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Mar 2010, Nancy, France. pp.11-16, 2010, Proceedings of the 27th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00456113〉

Record views