Acceptance Ambiguity for Quantum Automata
From MaRDI portal
Recommendations
Cites work
- A class of free rotation groups
- Characterizations of 1-Way Quantum Finite Automata
- Decidable and Undecidable Problems about Quantum Automata
- Decision problems concerning thinness and slenderness of formal languages
- Decision problems for probabilistic finite automata on bounded languages
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 3572058 (Why is no real title available?)
- scientific article; zbMATH DE number 1964689 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
- On Reachability Problems for Low-Dimensional Matrix Semigroups
- On the decidability of semigroup freeness.
- ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
- ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
- On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
- Periodic and Infinite Traces in Matrix Semigroups
- Quantum automata and quantum grammars
- Reachability problems in quaternion matrix and rotation semigroups
- Scalar ambiguity and freeness in matrix semigroups over bounded languages
- Some decision problems on integer matrices
- The freeness problem over matrix semigroups and bounded languages
- Undecidability bounds for integer matrices using Claus instances
- Undecidable problems for probabilistic automata of fixed dimension
- Unsolvability in 3 × 3 Matrices
- Vector Ambiguity and Freeness Problems in SL(2, ℤ)
Cited in
(3)
This page was built for publication: Acceptance Ambiguity for Quantum Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092433)
