Beyond $\omega$-Regular Languages
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...