The following pages link to (Q3455037):
Displaying 12 items.
- Promise problems solved by quantum and classical finite automata (Q511009) (← links)
- Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Improved constructions for succinct affine automata (Q2096598) (← links)
- Tight hierarchy of data-independent multi-head automata (Q2194865) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Classical and Quantum Counter Automata on Promise Problems (Q2947425) (← links)
- Minimal Size of Counters for (Real-Time) Multicounter Automata (Q5158661) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)
- Exact Affine Counter Automata (Q6114873) (← links)