Pages that link to "Item:Q2819147"
From MaRDI portal
The following pages link to Language Recognition Power and Succinctness of Affine Automata (Q2819147):
Displaying 11 items.
- Improved constructions for succinct affine automata (Q2096598) (← links)
- Affine automata verifiers (Q2152088) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Looking for Pairs that Hard to Separate: A Quantum Approach (Q2830222) (← links)
- (Q5016371) (← links)
- On the Computational Power of Affine Automata (Q5739014) (← links)
- Affine Computation and Affine Automaton (Q5740183) (← links)
- Language recognition power and succinctness of affine automata (Q6061995) (← links)
- Computational limitations of affine automata and generalized affine automata (Q6095491) (← links)
- Exact Affine Counter Automata (Q6114873) (← links)
- Error-Free Affine, Unitary, and Probabilistic OBDDs (Q6169903) (← links)
