The Hierarchy of LR-Attributed Grammars. - Rieks op den Akker; Borivoj Melichar; Jorma Tarhio (WAGA, 1990)

Attribute Evaluation and Parsing. - Rieks op den Akker; Borivoj Melichar; Jorma Tarhio (Attribute Grammars, Applications and Systems, 1991)

Syntax Directed Translation with LR Parsing. - Borivoj Melichar (CC, 1992)

Formal translation directed by LR parsing. - Borivoj Melichar (Kybernetika, 1992)

Transformations of translation grammars. - Borivoj Melichar (Kybernetika, 1994)

Approximate String Matching by Finite Automata. - Borivoj Melichar (CAIP, 1995)

String matching with k differences by finite automata. - Borivoj Melichar (ICPR, 1996)

Space Complexity of Linear Time Approximate String Matching. - Borivoj Melichar (Stringology, 1996)

Formal Translations Described by Translation Grammars with LR(k) Input Grammars. - Jan Janousek; Borivoj Melichar (PLILP, 1997)

The Output-Store Formal Translator Directed by LR Parsing. - Jan Janousek; Borivoj Melichar (SOFSEM, 1997)

6D Classification of Pattern Matching Problems. - Borivoj Melichar; Jan Holub 001 (Stringology, 1997)

Directed Acyclic Subsequence Graph. - Zdenek Tronícek; Borivoj Melichar (Stringology, 1998)

Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. - Jan Holub 001; Borivoj Melichar (Workshop on Implementing Automata, 1998)

Approximate string matching using factor automata. - Jan Holub 001; Borivoj Melichar (Theor. Comput. Sci., 2000)

On the Size of Deterministic Finite Automata. - Borivoj Melichar; Jan Skryja (CIAA, 2001)

Even faster generalized LR parsing. - John Aycock; R. Nigel Horspool; Jan Janousek; Borivoj Melichar (Acta Informatica, 2001)

Distributed Pattern Matching Using Finite Automata. - Jan Holub 001; Costas S. Iliopoulos; Borivoj Melichar; Laurent Mouchard (J. Autom. Lang. Comb., 2001)

Deterministic Parsing of Cyclic Strings. - Borivoj Melichar (CIAA, 2002)

Transformations of grammars and translation directed by LR parsing. - Borivoj Melichar; Nguyen Van Bac (Kybernetika, 2002)

Operation L-INSERT on Factor Automaton. - Borivoj Melichar; Milan Simánek (Stringology, 2003)

The Longest Common Subsequence Problem A Finite Automata Approach. - Borivoj Melichar; Tomás Polcar (CIAA, 2003)

Directed acyclic subsequence graph - Overview. - Maxime Crochemore; Borivoj Melichar; Zdenek Tronícek (J. Discrete Algorithms, 2003)

Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata. - Tomás Polcar; Borivoj Melichar (CIAA, 2004)

Backward pattern matching automaton. - Jan Antos; Borivoj Melichar (Stringology, 2005)

General pattern matching on regular collage system. - Jan Lahoda; Borivoj Melichar (Stringology, 2005)

On Two-Dimensional Pattern Matching by Finite Automata. - Jan Zdárek; Borivoj Melichar (CIAA, 2005)

Arithmetic coding in parallel. - Jan Supol; Borivoj Melichar (Int. J. Found. Comput. Sci., 2005)

A New Approach to Determinisation Using Bit-Parallelism. - Jan Supol; Borivoj Melichar (ICTAC, 2006)

Two-dimensional bitwise memory matrix: A tool for optimal parallel approximate pattern matching. - Jan Supol; Borivoj Melichar (Stringology, 2006)

Finding Common Motifs with Gaps Using Finite Automata. - Pavlos Antoniou; Jan Holub 001; Costas S. Iliopoulos; Borivoj Melichar; Pierre Peterlongo (CIAA, 2006)

Weighted Degenerated Approximate Pattern Matching. - Costas S. Iliopoulos; Inuka Jayasekera; Borivoj Melichar; Jan Supol (LATA, 2007)

Formal Translation Directed by Parallel LLP Parsing. - Ladislav Vagner; Borivoj Melichar (SOFSEM (1), 2007)

Parallel LL parsing. - Ladislav Vagner; Borivoj Melichar (Acta Informatica, 2007)

Borders and Finite Automata. - Martin Simunek; Borivoj Melichar (Int. J. Found. Comput. Sci., 2007)

Searching all approximate covers and their distance using finite automata. - Ondrej Guth; Borivoj Melichar; Miroslav Balík (ITAT, 2008)

Pattern Matching in DCA Coded Text. - Jan Lahoda; Borivoj Melichar; Jan Zdárek (CIAA, 2008)

Approximate Periods with Levenshtein Distance. - Martin Simunek; Borivoj Melichar (CIAA, 2008)

Subtree matching by deterministic pushdown automata. - Tomás Flouri; Borivoj Melichar; Jan Janousek (IMCSIT, 2009)

On regular tree languages and deterministic pushdown automata. - Jan Janousek; Borivoj Melichar (Acta Informatica, 2009)

Arbology: Trees and Pushdown Automata. - Borivoj Melichar (LATA, 2010)

Aho-Corasick like multiple subtree matching by pushdown automata. - Tomás Flouri; Borivoj Melichar; Jan Janousek (SAC, 2010)

Finite Automata for Generalized Approach to Backward Pattern Matching. - Jan Antos; Borivoj Melichar (CIAA, 2010)

A Note on a Tree-Based 2D Indexing. - Jan Zdárek; Borivoj Melichar (CIAA, 2010)

Subtree matching by pushdown automata. - Tomás Flouri; Jan Janousek; Borivoj Melichar (Comput. Sci. Inf. Syst., 2010)

Tree Indexing by Pushdown Automata and Repeats of Subtrees. - Tomás Flouri; Jan Janousek; Borivoj Melichar; Costas S. Iliopoulos; Solon P. Pissis (FedCSIS, 2011)

Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. - Martin Plicka; Jan Janousek; Borivoj Melichar (FedCSIS, 2011)

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

Computing All Subtree Repeats in Ordered Ranked Trees. - Michalis Christou; Maxime Crochemore; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (SPIRE, 2011)

Tree-Based 2D Indexing. - Jan Zdárek; Borivoj Melichar (Int. J. Found. Comput. Sci., 2011)

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

Computing all subtree repeats in ordered trees. - Michalis Christou; Maxime Crochemore; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (Inf. Process. Lett., 2012)

Tree template matching in ranked ordered trees by pushdown automata. - Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis (J. Discrete Algorithms, 2012)

Tree compression pushdown automaton. - Jan Janousek; Borivoj Melichar; Martin Poliak (Kybernetika, 2012)

Arbology: Trees and pushdown automata. - Borivoj Melichar; Jan Janousek; Tomás Flouri (Kybernetika, 2012)

Graphs and Automata. - Borivoj Melichar (Stringology, 2013)

Tree template matching in unranked ordered trees. - Michalis Christou; Tomás Flouri; Costas S. Iliopoulos; Jan Janousek; Borivoj Melichar; Solon P. Pissis; Jan Zdárek (J. Discrete Algorithms, 2013)

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)

Constrained Approximate Subtree Matching by Finite Automata. - Eliska Sestáková; Borivoj Melichar; Jan Janousek (Stringology, 2018)

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)