Pages that link to "Item:Q3624380"
From MaRDI portal
The following pages link to Tree-Walking Automata Do Not Recognize All Regular Languages (Q3624380):
Displayed 13 items.
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- Walking on data words (Q504989) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Parametric random generation of deterministic tree automata (Q1959655) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Automata on finite trees (Q2074209) (← links)
- State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
- Homomorphisms on graph-walking automata (Q2164747) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- Random Generation of Deterministic Tree (Walking) Automata (Q3637348) (← links)
- Plane-Walking Automata (Q5501619) (← links)
- Homomorphisms and inverse homomorphisms on graph-walking automata (Q6057839) (← links)
- Tree-walking-storage automata (Q6088945) (← links)