Pages that link to "Item:Q1017403"
From MaRDI portal
The following pages link to Improved constructions of quantum automata (Q1017403):
Displaying 15 items.
- State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Quantum online algorithms with respect to space and advice complexity (Q669542) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Potential of Quantum Finite Automata with Exact Acceptance (Q2947961) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- Descriptional complexity of iterated uniform finite-state transducers (Q5918615) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Quantum algorithm for dynamic programming approach for DAGs and applications (Q6043927) (← links)
- Deterministic construction of QFAs based on the quantum fingerprinting technique (Q6043928) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
- GAPs for Shallow Implementation of Quantum Finite Automata (Q6204142) (← links)