Pages that link to "Item:Q6061995"
From MaRDI portal
The following pages link to Language recognition power and succinctness of affine automata (Q6061995):
Displaying 5 items.
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition (Q1633055) (← links)
- Language recognition by two-way deterministic pushdown automata (Q2571535) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Computational limitations of affine automata and generalized affine automata (Q6095491) (← links)