Quantum Büchi automata
From MaRDI portal
Publication:6593677
DOI10.1016/j.tcs.2024.114740MaRDI QIDQ6593677
Publication date: 27 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
decision problemsquantum computingclosure propertiesBüchi automataquantum finite automatapumping lemmas\( \omega \)-languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum strategies
- On the complexity of minimizing probabilistic and quantum automata
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition
- A theory of timed automata
- Quantum automata and quantum grammars
- Quantum \(\omega\)-automata over infinite words and their relationships
- Equivalence checking of quantum finite-state machines
- Automata and quantum computing
- Termination of nondeterministic quantum programs
- Determination of equivalence between quantum sequential machines
- Determining the equivalence for one-way quantum finite automata
- Quantum strategic game theory
- Finitary Languages
- Quantum Computation and Quantum Information
- Characterizations of 1-Way Quantum Finite Automata
- (Un)decidable Problems about Reachability of Quantum Systems
- On ω-sets associated with context-free languages
- Quantum Games and Quantum Strategies
- Model Checking Quantum Systems
- Decidable and Undecidable Problems about Quantum Automata
- Probabilistic ω-automata
- Model Checking for Verification of Quantum Circuits
This page was built for publication: Quantum Büchi automata
