This work continues the investigation on measure-once quan- tum finite automata by topological arguments. We study conditions ensuring the decidability of intersection and classification problems for quantum finite automata, with respe ct to families of context-free languages and some variants.

On Some Decision Problems on Quantum Automata / F. D'Alessandro, C.M. (LECTURE NOTES IN COMPUTER SCIENCE). - In: Developments in Language Theory / [a cura di] M.-P. Béal, P. Caron. - [s.l] : Springer, 2026. - ISBN 9783032284037. - pp. 3-17 (( 30. DLT International Conference : June 30 – July 3 Rouen (France) 2026 [10.1007/978-3-032-28404-4_1].

On Some Decision Problems on Quantum Automata

C. Mereghetti
Secondo
;
B. Palano
Penultimo
;
2026

Abstract

This work continues the investigation on measure-once quan- tum finite automata by topological arguments. We study conditions ensuring the decidability of intersection and classification problems for quantum finite automata, with respe ct to families of context-free languages and some variants.
Quantum automata; Context-free languages; Algebraic groups· Decidability;
Settore INFO-01/A - Informatica
2026
Book Part (author)
File in questo prodotto:
File Dimensione Formato  
978-3-032-28404-4_1.pdf

accesso riservato

Tipologia: Publisher's version/PDF
Licenza: Nessuna licenza
Dimensione 590.64 kB
Formato Adobe PDF
590.64 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/1252764
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
  • OpenAlex 0
social impact