On relation between linear temporal logic and quantum finite automata
From MaRDI portal
Publication:783667
DOI10.1007/s10849-019-09302-6zbMath1477.68147OpenAlexW2972371375MaRDI QIDQ783667
Amandeep Singh Bhatia, Ajay Kumar
Publication date: 4 August 2020
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10849-019-09302-6
linear temporal logicquantum finite automatameasure-many one-way quantum finite automataLatvian quantum finite automatameasure-once one-way quantum finite automata
Formal languages and automata (68Q45) Temporal logic (03B44) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal bounds in parametric LTL games
- Two-tape finite automata with quantum and classical states
- Mathematical logic and quantum finite state automata
- Quantum automata and quantum grammars
- Quantum \(\omega\)-automata over infinite words and their relationships
- Modeling of RNA secondary structures using two-way quantum finite automata
- Algebraic results on quantum automata
- Characterizations of 1-Way Quantum Finite Automata
- One-Way Finite Automata with Quantum and Classical States
- Weak Second‐Order Arithmetic and Finite Automata
- Regular Linear Temporal Logic
- The complexity of propositional linear temporal logics
- Decision Problems of Finite Automata Design and Related Arithmetics
- On the power of two-way multihead quantum finite automata
- On finite monoids having only trivial subgroups
- Testing and generating infinite sequences by a finite automaton
- Decidability of Second-Order Theories and Automata on Infinite Trees
