Pages that link to "Item:Q817841"
From MaRDI portal
The following pages link to Tree-walking automata cannot be determinized (Q817841):
Displayed 13 items.
- Loops and overloops for tree-walking automata (Q442148) (← links)
- Walking on data words (Q504989) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Automata on finite trees (Q2074209) (← links)
- Algebra for trees (Q2074223) (← links)
- Homomorphisms on graph-walking automata (Q2164747) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- State complexity of transforming graph-walking automata to halting, returning and reversible (Q2687992) (← links)
- Deterministic Caterpillar Expressions (Q3503898) (← links)
- Loops and Overloops for Tree Walking Automata (Q5200062) (← links)
- Homomorphisms and inverse homomorphisms on graph-walking automata (Q6057839) (← links)
- Tree-walking-storage automata (Q6088945) (← links)
- Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs (Q6178459) (← links)