Pages that link to "Item:Q2687992"
From MaRDI portal
The following pages link to State complexity of transforming graph-walking automata to halting, returning and reversible (Q2687992):
Displaying 4 items.
- State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← 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)