 | 2011 |
| 13 |  | Tomás Flouri,
Jan Janousek,
Borivoj Melichar,
Costas S. Iliopoulos,
Solon P. Pissis:
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata.
CIAA 2011: 273-281 |
| 12 |  | Jan Travnicek,
Jan Janousek,
Borivoj Melichar:
Nonlinear Tree Pattern Pushdown Automata.
FedCSIS 2011: 871-878 |
| 11 |  | Tomás Flouri,
Jan Janousek,
Borivoj Melichar,
Costas S. Iliopoulos,
Solon P. Pissis:
Tree Indexing by Pushdown Automata and Repeats of Subtrees.
FedCSIS 2011: 899-902 |
| 10 |  | Martin Plicka,
Jan Janousek,
Borivoj Melichar:
Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees.
FedCSIS 2011: 903-906 |
| 9 |  | Michalis Christou,
Maxime Crochemore,
Tomás Flouri,
Costas S. Iliopoulos,
Jan Janousek,
Borivoj Melichar,
Solon P. Pissis:
Computing All Subtree Repeats in Ordered Ranked Trees.
SPIRE 2011: 338-343 |
| 2010 |
| 8 |  | Tomás Flouri,
Borivoj Melichar,
Jan Janousek:
Aho-Corasick like multiple subtree matching by pushdown automata.
SAC 2010: 2157-2158 |
| 7 |  | Tomás Flouri,
Jan Janousek,
Borivoj Melichar:
Subtree matching by pushdown automata.
Comput. Sci. Inf. Syst. 7(2): 331-357 (2010) |
| 2009 |
| 6 |  | Tomás Flouri,
Borivoj Melichar,
Jan Janousek:
Subtree matching by deterministic pushdown automata.
IMCSIT 2009: 659-666 |
| 5 |  | Jan Janousek:
String Suffix Automata and Subtree Pushdown Automata.
Stringology 2009: 160-172 |
| 4 |  | Jan Janousek,
Borivoj Melichar:
On regular tree languages and deterministic pushdown automata.
Acta Inf. 46(7): 533-547 (2009) |
| 2001 |
| 3 |  | John Aycock,
R. Nigel Horspool,
Jan Janousek,
Borivoj Melichar:
Even faster generalized LR parsing.
Acta Inf. 37(9): 633-651 (2001) |
| 1997 |
| 2 |  | Jan Janousek,
Borivoj Melichar:
Formal Translations Described by Translation Grammars with LR(k) Input Grammars.
PLILP 1997: 421-422 |
| 1 |  | Jan Janousek,
Borivoj Melichar:
The Output-Store Formal Translator Directed by LR Parsing.
SOFSEM 1997: 432-439 |