Pages that link to "Item:Q2096581"

The following pages link to Deterministic one-way simulation of two-way deterministic finite automata over small alphabets (Q2096581):

Displayed 3 items.

• Homomorphisms on graph-walking automata (Q2164747) ‎ (← links)
• Homomorphisms and inverse homomorphisms on graph-walking automata (Q6057839) ‎ (← links)
• Shortest accepted strings for two-way finite automata: approaching the \(2^n\) lower bound (Q6175095) ‎ (← links)