Pages that link to "Item:Q1854417"
From MaRDI portal
The following pages link to Regular languages accepted by quantum automata (Q1854417):
Displaying 22 items.
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- Some algebraic properties of measure-once two-way quantum finite automata (Q1007122) (← links)
- Weakly regular quantum grammars and asynchronous quantum automata (Q1013764) (← links)
- Efficient probability amplification in two-way quantum finite automata (Q1017406) (← links)
- A note on quantum sequential machines (Q1029358) (← links)
- Properties of quantum languages (Q1610690) (← links)
- Energy complexity of regular language recognition (Q2164753) (← links)
- On hybrid models of quantum finite automata (Q2353395) (← links)
- Quantum automata for some multiperiodic languages (Q2465050) (← 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)
- Determining the equivalence for one-way quantum finite automata (Q2518375) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Quantum finite automata with control language (Q3431442) (← links)
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA (Q5696942) (← links)
- Preface (Q5898759) (← links)
- Trace monoids with idempotent generators and measure-only quantum automata (Q5962066) (← links)
- Energy complexity of regular languages (Q6199407) (← links)
