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.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00456113
Contributor : Publications Loria <>
Submitted on : Friday, February 19, 2010 - 3:05:05 PM
Last modification on : Thursday, February 7, 2019 - 2:35:00 PM
Long-term archiving on : Friday, June 18, 2010 - 6:27:06 PM

File

bojanczyk.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00456113, version 1

Collections

Citation

Mikolaj Bojanczyk. Beyond $\omega$-Regular Languages. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.11-16. ⟨inria-00456113⟩

Share

Metrics

Record views

170

Files downloads

255