MMQBA languages equal the limits of languages from measure-many quantum finite automata; the model is closed under union but not intersection or complement, with emptiness semi-decidable and universality, inclusion, equivalence, and membership undecidable.
Theoretical Computer Science 1012, 114740 (2024)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Measure Many Quantum Finite Automata on Infinite Words
MMQBA languages equal the limits of languages from measure-many quantum finite automata; the model is closed under union but not intersection or complement, with emptiness semi-decidable and universality, inclusion, equivalence, and membership undecidable.