This work continues the investigation on measure-once quantum finite automata by topological arguments, building on the work by Bertoni et al. We study conditions ensuring the decidability of intersection and classification problems for quantum finite automata, with respect to families of context-free languages and some variants.
On Some Decision Problems on Quantum Automata / D'Alessandro, F., Mereghetti, C., Palano, B., Papi, P.. - 16578:(2026), pp. 3-17. (Developments in Language Theory (DLT 2026) Rouen, Francia ) [10.1007/978-3-032-28404-4_1].
On Some Decision Problems on Quantum Automata
Flavio D'Alessandro;Paolo Papi
2026
Abstract
This work continues the investigation on measure-once quantum finite automata by topological arguments, building on the work by Bertoni et al. We study conditions ensuring the decidability of intersection and classification problems for quantum finite automata, with respect to families of context-free languages and some variants.File allegati a questo prodotto
| File | Dimensione | Formato | |
|---|---|---|---|
|
D’Alessandro_On Some Decision Problems_2026.pdf
solo gestori archivio
Note: reprint
Tipologia:
Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
590.64 kB
Formato
Adobe PDF
|
590.64 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
