Pages that link to "Item:Q1566730"
From MaRDI portal
The following pages link to Quantum automata and quantum grammars (Q1566730):
Displaying 50 items.
- Periodic generalized automata over the reals (Q2280333) (← links)
- On coverings of products of uninitialized sequential quantum machines (Q2323760) (← links)
- Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata (Q2343133) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- On intuitionistic fuzzy context-free languages (Q2375678) (← links)
- Automata theory based on quantum logic: recognizability and accessibility (Q2390829) (← links)
- Nondeterministic unitary OBDDs (Q2399370) (← links)
- Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
- Quantum automata and algebraic groups (Q2456549) (← links)
- Quantum automata for some multiperiodic languages (Q2465050) (← links)
- Computing spin networks (Q2484201) (← links)
- Small size quantum automata recognizing some regular languages (Q2484448) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- Determination of equivalence between quantum sequential machines (Q2503273) (← links)
- Finite state and finite stop quantum languages (Q2506022) (← links)
- Interactive proofs with quantum finite automata (Q2513604) (← links)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Interference automata (Q2518378) (← links)
- A theory of computation based on quantum logic. I (Q2575078) (← links)
- On the computational power of probabilistic and quantum branching program (Q2581534) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- Quantum grammars. (Q2738056) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- An algebra of automata that includes both classical and quantum entities (Q2825378) (← links)
- Looking for Pairs that Hard to Separate: A Quantum Approach (Q2830222) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Classical and Quantum Counter Automata on Promise Problems (Q2947425) (← links)
- Potential of Quantum Finite Automata with Exact Acceptance (Q2947961) (← links)
- Quantum Automata Theory – A Review (Q3098037) (← links)
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
- One-Way Finite Automata with Quantum and Classical States (Q3166958) (← links)
- On quantum realisation of Boolean functions by the fingerprinting technique (Q3225895) (← links)
- Languages Recognized with Unbounded Error by Quantum Finite Automata (Q3392970) (← links)
- Quantum finite automata with control language (Q3431442) (← links)
- Complexity Bounds of Constant-Space Quantum Computation (Q3451121) (← links)
- Lower Bounds for Generalized Quantum Finite Automata (Q3540128) (← links)
- Computation in Sofic Quantum Dynamical Systems (Q3603417) (← links)
- A Bialgebraic Approach to Automata and Formal Language Theory (Q3605547) (← links)
- (Q3990820) (← links)
- Spectral simplicity of apparent complexity. I. The nondiagonalizable metadynamics of prediction (Q4565944) (← links)
- On a Conjecture by Christian Choffrut (Q4605510) (← links)
- Quantum Pushdown Automata with Garbage Tape (Q4640342) (← links)
- (Q4710019) (← links)
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors (Q4800259) (← links)
- SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
- JUMPING FINITE AUTOMATA (Q4923298) (← links)
- (Q4988166) (← links)
- Universal Neural Field Computation (Q4992856) (← links)