Pages that link to "Item:Q2140513"
From MaRDI portal
The following pages link to Deciding top-down determinism of regular tree languages (Q2140513):
Displaying 4 items.
- On regular tree languages and deterministic pushdown automata (Q1037619) (← links)
- It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton (Q4601120) (← links)
- Checking in polynomial time whether or not a regular tree language is deterministic top-down (Q6121430) (← links)
- On the Boolean Closure of Deterministic Top-Down Tree Automata (Q6154972) (← links)