Cargando…
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages
We prove that if a data language and its complement are both recognized by nondeterministic register automata (without guessing), then they are also recognized by deterministic ones.
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984108/ http://dx.doi.org/10.1007/978-3-030-71995-1_19 |