Pages that link to "Item:Q1037619"
From MaRDI portal
The following pages link to On regular tree languages and deterministic pushdown automata (Q1037619):
Displaying 12 items.
- Regular languages of thin trees (Q290908) (← links)
- Tree template matching in unranked ordered trees (Q396647) (← links)
- Simple tree pattern matching for trees in the prefix bar notation (Q496555) (← links)
- Tree template matching in ranked ordered trees by pushdown automata (Q2376785) (← links)
- THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES (Q3021939) (← links)
- (Q3165666) (← links)
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134) (← links)
- PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS (Q4020278) (← links)
- (Q4497404) (← links)
- It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton (Q4601120) (← links)
- Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (Q5200071) (← links)
- (Q5696194) (← links)
