Cargando…
Certifying Inexpressibility
Different classes of automata on infinite words have different expressive power. Deciding whether a given language [Formula: see text] can be expressed by an automaton of a desired class can be reduced to deciding a game between Prover and Refuter: in each turn of the game, Refuter provides a letter...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984136/ http://dx.doi.org/10.1007/978-3-030-71995-1_20 |