On injectivity of quantum finite automata
From MaRDI portal
Publication:2229947
DOI10.1016/j.jcss.2021.05.002OpenAlexW3169244785WikidataQ123249939 ScholiaQ123249939MaRDI QIDQ2229947
Publication date: 17 September 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.01471
Cites Work
- Reachability problems in quaternion matrix and rotation semigroups
- Decision problems concerning thinness and slenderness of formal languages
- A class of free rotation groups
- Undecidable problems for probabilistic automata of fixed dimension
- Quantum automata and quantum grammars
- The freeness problem over matrix semigroups and bounded languages
- Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages
- On the decidability of semigroup freeness
- UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
- ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS
- Characterizations of 1-Way Quantum Finite Automata
- ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
- Some decision problems on integer matrices
- Vector Ambiguity and Freeness Problems in SL(2, ℤ)
- Decision Problems for Probabilistic Finite Automata on Bounded Languages
- On Reachability Problems for Low-Dimensional Matrix Semigroups
- Acceptance Ambiguity for Quantum Automata
- Decidable and Undecidable Problems about Quantum Automata
- Periodic and Infinite Traces in Matrix Semigroups
- Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages
- Unsolvability in 3 × 3 Matrices
- ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On injectivity of quantum finite automata
