Pages that link to "Item:Q1566730"
From MaRDI portal
The following pages link to Quantum automata and quantum grammars (Q1566730):
Displaying 30 items.
- Complexity of Grammar Induction for Quantum Types (Q4997295) (← links)
- Acceptance Ambiguity for Quantum Automata (Q5092433) (← links)
- The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints (Q5130748) (← links)
- Quantum Physics, Topology, Formal Languages, Computation: A Categorical View as Homage to David Hilbert (Q5169376) (← links)
- On the power of two-way multihead quantum finite automata (Q5223828) (← links)
- (Q5232904) (← links)
- ON THE DECIDABILITY OF THE INTERSECTION PROBLEM FOR QUANTUM AUTOMATA AND CONTEXT-FREE LANGUAGES (Q5247175) (← links)
- Inverse problems in dynamic cognitive modeling (Q5251426) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- Improved Constructions of Quantum Automata (Q5503296) (← links)
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA (Q5696942) (← links)
- Affine Computation and Affine Automaton (Q5740183) (← links)
- On the Power of One-Way Automata with Quantum and Classical States (Q5744127) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Deterministic construction of QFAs based on the quantum fingerprinting technique (Q6043928) (← links)
- Classically time-controlled quantum automata (Q6049068) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)
- Optimality and complexity in measured quantum-state stochastic processes (Q6110780) (← links)
- Quaternionic quantum automata (Q6114652) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
- Mirrors and memory in quantum automata (Q6160780) (← links)
- Lattice-valued general orthomodular automata (Q6163511) (← links)
- Error-Free Affine, Unitary, and Probabilistic OBDDs (Q6169903) (← links)
- Eilenberg's variety theorem without Boolean operations (Q6186309) (← links)
- Energy complexity of regular languages (Q6199407) (← links)
- GAPs for Shallow Implementation of Quantum Finite Automata (Q6204142) (← links)
- On typical hesitant fuzzy languages and automata (Q6535992) (← links)
- Quantum Büchi automata (Q6593677) (← links)
- Quantum temporal logic and reachability problems of matrix semigroups (Q6614888) (← links)
