Nondeterministic tree-walking automata are not closed under complementation
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912142454685696 |
|---|---|
| author | Martynova, Olga Okhotin, Alexander |
| author_facet | Martynova, Olga Okhotin, Alexander |
| contents | It is proved that the family of tree languages recognized by nondeterministic tree-walking automata is not closed under complementation, solving a problem raised by Bojańczyk and Colcombet ("Tree-walking automata do not recognize all regular languages", SIAM J. Comp. 38 (2008) 658--701). In addition, it is shown that nondeterministic tree-walking automata are stronger than unambiguous tree-walking automata. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_02618 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Nondeterministic tree-walking automata are not closed under complementation Martynova, Olga Okhotin, Alexander Formal Languages and Automata Theory 68Q45 It is proved that the family of tree languages recognized by nondeterministic tree-walking automata is not closed under complementation, solving a problem raised by Bojańczyk and Colcombet ("Tree-walking automata do not recognize all regular languages", SIAM J. Comp. 38 (2008) 658--701). In addition, it is shown that nondeterministic tree-walking automata are stronger than unambiguous tree-walking automata. |
| title | Nondeterministic tree-walking automata are not closed under complementation |
| topic | Formal Languages and Automata Theory 68Q45 |
| url | https://arxiv.org/abs/2412.02618 |