Pages that link to "Item:Q2216129"

The following pages link to Reversibility of computations in graph-walking automata (Q2216129):

Displaying 6 items.

• Deterministic one-way simulation of two-way deterministic finite automata over small alphabets (Q2096581) (← links)
• State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
• Homomorphisms on graph-walking automata (Q2164747) (← links)
• State complexity of transforming graph-walking automata to halting, returning and reversible (Q2687992) (← links)
• Homomorphisms and inverse homomorphisms on graph-walking automata (Q6057839) (← links)
• Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs (Q6178459) (← links)