Boundedness in languages of infinite words
We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of $\omega$-regular expressions where two new variants of the Kleene star $L^*$ are added...
Zapisane w:
| Główni autorzy: | , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
Logical Methods in Computer Science e.V.
2017-10-01
|
| Seria: | Logical Methods in Computer Science |
| Hasła przedmiotowe: | |
| Dostęp online: | https://lmcs.episciences.org/3916/pdf |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|