Pages that link to "Item:Q3021939"
From MaRDI portal
The following pages link to THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES (Q3021939):
Displaying 6 items.
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- On regular tree languages and deterministic pushdown automata (Q1037619) (← links)
- On the degree of nondeterminism of tree adjoining languages and head grammar languages (Q2400990) (← links)
- It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton (Q4601120) (← links)
- (Q5696194) (← links)