Pages that link to "Item:Q3149086"
From MaRDI portal
The following pages link to Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086):
Displaying 15 items.
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Iterated uniform finite-state transducers on unary languages (Q831808) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Quantum automata for some multiperiodic languages (Q2465050) (← links)
- Small size quantum automata recognizing some regular languages (Q2484448) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- Quantum finite automata with control language (Q3431442) (← links)
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors (Q4800259) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA (Q5696942) (← links)
- Descriptional complexity of iterated uniform finite-state transducers (Q5918615) (← links)
- Iterated uniform finite-state transducers on unary languages (Q6165558) (← links)
