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.
Origin : Files produced by the author(s)
Loading...