This paper continues the study of measure-once finite quan tum automata building on work by Bertoni et al. and Blondel et al. We investigate conditions ensuring 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 decidable whether or not they have a nonempty intersection.
Quantum Automata and Languages of Finite Index / Benso A.; D'Alessandro F.; Papi P.. - ELETTRONICO. - 15050 LNCS:(2024), pp. 88-103. [10.1007/978-3-031-72621-7_7]
Quantum Automata and Languages of Finite Index
Benso A.;
2024
Abstract
This paper continues the study of measure-once finite quan tum automata building on work by Bertoni et al. and Blondel et al. We investigate conditions ensuring 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 decidable whether or not they have a nonempty intersection.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
978-3-031-72621-7.pdf
Accesso chiuso
Licenza:
Tutti i diritti riservati
Dimensione
7.7 MB
Formato
Adobe PDF
|
7.7 MB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
