Published January 1, 2024
| Version v1
Conference paper
Open
Quantum Automata and Languages of Finite Index
- 1. Univ Firenze, Dipartimento Matemat & Informat U Dini, I-50134 Florence, Italy
- 2. Sapienza Univ Roma, Dipartimento Matemat G Castelnuovo, I-00185 Rome, Italy
Description
This paper continues the study of measure-once finite quantum 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.
Files
bib-aa4ec64b-c5df-4cf1-83a7-d8cfd9a939e9.txt
Files
(127 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:744e33c3a98a650ae7ce36aa1c6a1ab0
|
127 Bytes | Preview Download |