On the Intersection Problem for Quantum Finite Automata
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_ | 1866909689571180544 |
|---|---|
| author | Benso, Andrea D'Alessandro, Flavio Papi, Paolo |
| author_facet | Benso, Andrea D'Alessandro, Flavio Papi, Paolo |
| contents | This paper is a continuation of a previous study on the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We investigate conditions assuring that, given a language recognized by such a device and a language generated by a context-free grammar of finite index or by a matrix context-free grammar, it is recursively decidable whether or not they have a nonempty intersection. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_13797 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Intersection Problem for Quantum Finite Automata Benso, Andrea D'Alessandro, Flavio Papi, Paolo Formal Languages and Automata Theory 81P68, 68Q45, 03D05 This paper is a continuation of a previous study on the so-called measure once finite quantum automata model introduced by Moore and Crutchfield in 2000. We investigate conditions assuring that, given a language recognized by such a device and a language generated by a context-free grammar of finite index or by a matrix context-free grammar, it is recursively decidable whether or not they have a nonempty intersection. |
| title | On the Intersection Problem for Quantum Finite Automata |
| topic | Formal Languages and Automata Theory 81P68, 68Q45, 03D05 |
| url | https://arxiv.org/abs/2406.13797 |