Pages that link to "Item:Q5317206"
From MaRDI portal
The following pages link to Decidable and Undecidable Problems about Quantum Automata (Q5317206):
Displaying 26 items.
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Reachability problems in quaternion matrix and rotation semigroups (Q958311) (← links)
- A note on quantum sequential machines (Q1029358) (← links)
- Reachability analysis of quantum Markov decision processes (Q1627964) (← links)
- Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\) (Q1740664) (← links)
- Quantum computation with write-only memory (Q1761714) (← links)
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond (Q2051775) (← links)
- On injectivity of quantum finite automata (Q2229947) (← links)
- Quantum automata and algebraic groups (Q2456549) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- An optimal quantum error-correcting procedure using quantifier elimination (Q2690239) (← links)
- ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS (Q3069735) (← links)
- (Un)decidable Problems about Reachability of Quantum Systems (Q3190137) (← links)
- On Reachability Problems for Low-Dimensional Matrix Semigroups (Q5091195) (← links)
- Acceptance Ambiguity for Quantum Automata (Q5092433) (← links)
- On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond (Q5092447) (← links)
- (Q5111259) (← links)
- (Q5232904) (← links)
- ON THE DECIDABILITY OF THE INTERSECTION PROBLEM FOR QUANTUM AUTOMATA AND CONTEXT-FREE LANGUAGES (Q5247175) (← links)
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete (Q6178465) (← links)
- Quantum Büchi automata (Q6593677) (← links)
- Many bounded versions of undecidable problems are \textsf{NP}-hard (Q6594491) (← links)
- Quantum temporal logic and reachability problems of matrix semigroups (Q6614888) (← links)
- Semigroup intersection problems in the Heisenberg groups (Q6654128) (← links)
