Nonlinear Tree Pattern Pushdown Automata. - Jan Travnicek; Jan Janousek; Borivoj Melichar (FedCSIS, 2011)

Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata. - Jan Travnicek; Jan Janousek; Borivoj Melichar (Comput. Sci. Inf. Syst., 2012)

A Full and Linear Index of a Tree for Tree Patterns. - Jan Janousek; Borivoj Melichar; Radomír Polách; Martin Poliak; Jan Trávnícek (DCFS, 2014)

A new algorithm for the determinisation of visibly pushdown automata. - Radomír Polách; Jan Travnicek; Jan Janousek; Borivoj Melichar (FedCSIS, 2015)

Backward Linearised Tree Pattern Matching. - Jan Trávnícek; Jan Janousek; Borivoj Melichar; Loek G. Cleophas (LATA, 2015)

Efficient determinization of visibly and height-deterministic pushdown automata. - Radomír Polách; Jan Trávnícek; Jan Janousek; Borivoj Melichar (Comput. Lang. Syst. Struct., 2016)

Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression. - Tomás Pecka; Jan Trávnícek; Radomír Polách; Jan Janousek (SLATE, 2018)

Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination. - Tomás Pecka; Jan Trávnícek; Jan Janousek (Stringology, 2020)

On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees. - Jan Trávnícek; Jan Janousek; Borivoj Melichar; Loek Cleophas (Theor. Comput. Sci., 2020)

Forward linearised tree pattern matching using tree pattern border array. - Jan Trávnícek; Tomás Pecka; Robin Oburka; Jan Janousek (Discret. Appl. Math., 2024)