This paper continues the study of measure-once finite quantum automata building on work by Bertoni, Choffrut et al. We investigate conditions ensuring that, given a language recognized by such a device and a language generated by a grammar, it is decidable whether or not they have a nonempty intersection.
On the intersection problem for quantum finite automata / Benso, Andrea; D'Alessandro, Flavio; Papi, Paolo. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - ELETTRONICO. - 1053:(2025), pp. 115454.115454-115454.115454. [10.1016/j.tcs.2025.115454]
On the intersection problem for quantum finite automata
Benso, Andrea;
2025
Abstract
This paper continues the study of measure-once finite quantum automata building on work by Bertoni, Choffrut et al. We investigate conditions ensuring that, given a language recognized by such a device and a language generated by a grammar, it is decidable whether or not they have a nonempty intersection.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
A. Benso, F. D_Alessandro, P. Papi. On the intersection problem for quantum finite automata, TCS (2025)..pdf
accesso aperto
Tipologia:
Pdf editoriale (Version of record)
Licenza:
Tutti i diritti riservati
Dimensione
1.34 MB
Formato
Adobe PDF
|
1.34 MB | Adobe PDF |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
