The following pages link to (Q4808680):
Displaying 9 items.
- Size lower bounds for quantum automata (Q403023) (← links)
- Exponentially more concise quantum recognition of non-RMM regular languages (Q473186) (← links)
- Characterizations of one-way general quantum finite automata (Q764358) (← links)
- On a class of languages recognizable by probabilistic reversible decide-and-halt automata (Q1017410) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Quantum finite automata with control language (Q3431442) (← links)
- Artin’s Conjecture and Size of Finite Probabilistic Automata (Q5452183) (← links)
- Trace monoids with idempotent generators and measure-only quantum automata (Q5962066) (← links)
