The following pages link to Jan Janoušek (Q199218):
Displayed 15 items.
- Tree template matching in unranked ordered trees (Q396647) (← links)
- On regular tree languages and deterministic pushdown automata (Q1037619) (← links)
- Efficient determinization of visibly and height-deterministic pushdown automata (Q1749148) (← links)
- Computing all subtree repeats in ordered trees (Q1941702) (← links)
- On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees (Q2182712) (← links)
- Tree template matching in ranked ordered trees by pushdown automata (Q2376785) (← links)
- Inexact tree pattern matching with 1-degree edit distance using finite automata (Q2689648) (← links)
- Backward Linearised Tree Pattern Matching (Q2799210) (← links)
- (Q3165666) (← links)
- (Q3165668) (← links)
- On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching (Q3297787) (← links)
- Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (Q5200071) (← links)
- A Full and Linear Index of a Tree for Tree Patterns (Q5496189) (← links)
- Even faster generalized LR parsing (Q5941744) (← links)
- On the smallest synchronizing terms of finite tree automata (Q6199864) (← links)