Borivoj Melichar

Publication Activity (10 Years)

Years Active: 1990-2020
Publications (10 Years): 3

Top Topics

Deformable Templates

Finite Automata

Top Venues

J. Discrete Algorithms

Comput. Lang. Syst. Struct.

Publications

Jan Trávnícek, Jan Janousek, Borivoj Melichar, Loek Cleophas
On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees. Theor. Comput. Sci. (2020)
Eliska Sestáková, Borivoj Melichar, Jan Janousek
Constrained Approximate Subtree Matching by Finite Automata. Stringology (2018)
Radomír Polách, Jan Trávnícek, Jan Janousek, Borivoj Melichar
Efficient determinization of visibly and height-deterministic pushdown automata. Comput. Lang. Syst. Struct. 46 (2016)
Jan Trávnícek, Jan Janousek, Borivoj Melichar, Loek G. Cleophas
Backward Linearised Tree Pattern Matching. LATA (2015)
Radomír Polách, Jan Travnicek, Jan Janousek, Borivoj Melichar
A new algorithm for the determinisation of visibly pushdown automata. FedCSIS (2015)
Jan Janousek, Borivoj Melichar, Radomír Polách, Martin Poliak, Jan Trávnícek
A Full and Linear Index of a Tree for Tree Patterns. DCFS (2014)
Michalis Christou, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, Jan Zdárek
Tree template matching in unranked ordered trees. J. Discrete Algorithms 20 (2013)
Borivoj Melichar
Graphs and Automata. Stringology (2013)
Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
Tree template matching in ranked ordered trees by pushdown automata. J. Discrete Algorithms 17 (2012)
Jan Travnicek, Jan Janousek, Borivoj Melichar
Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata. Comput. Sci. Inf. Syst. 9 (3) (2012)
Borivoj Melichar, Jan Janousek, Tomás Flouri
Arbology: Trees and pushdown automata. Kybernetika 48 (3) (2012)
Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
Computing all subtree repeats in ordered trees. Inf. Process. Lett. 112 (24) (2012)
Jan Janousek, Borivoj Melichar, Martin Poliak
Tree compression pushdown automaton. Kybernetika 48 (3) (2012)
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)
Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis
Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS (2011)
Martin Plicka, Jan Janousek, Borivoj Melichar
Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. FedCSIS (2011)
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)
Jan Zdárek, Borivoj Melichar
Tree-Based 2D Indexing. Int. J. Found. Comput. Sci. 22 (8) (2011)
Jan Travnicek, Jan Janousek, Borivoj Melichar
Nonlinear Tree Pattern Pushdown Automata. FedCSIS (2011)
Jan Zdárek, Borivoj Melichar
A Note on a Tree-Based 2D Indexing. CIAA (2010)
Tomás Flouri, Borivoj Melichar, Jan Janousek
Aho-Corasick like multiple subtree matching by pushdown automata. SAC (2010)
Tomás Flouri, Jan Janousek, Borivoj Melichar
Subtree matching by pushdown automata. Comput. Sci. Inf. Syst. 7 (2) (2010)
Borivoj Melichar
Arbology: Trees and Pushdown Automata. LATA (2010)
Jan Antos, Borivoj Melichar
Finite Automata for Generalized Approach to Backward Pattern Matching. CIAA (2010)
Jan Janousek, Borivoj Melichar
On regular tree languages and deterministic pushdown automata. Acta Informatica 46 (7) (2009)
Tomás Flouri, Borivoj Melichar, Jan Janousek
Subtree matching by deterministic pushdown automata. IMCSIT (2009)
Martin Simunek, Borivoj Melichar
Approximate Periods with Levenshtein Distance. CIAA (2008)
Jan Lahoda, Borivoj Melichar, Jan Zdárek
Pattern Matching in DCA Coded Text. CIAA (2008)
Ondrej Guth, Borivoj Melichar, Miroslav Balík
Searching all approximate covers and their distance using finite automata. ITAT (2008)
Costas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol
Weighted Degenerated Approximate Pattern Matching. LATA (2007)
Ladislav Vagner, Borivoj Melichar
Parallel LL parsing. Acta Informatica 44 (1) (2007)
Ladislav Vagner, Borivoj Melichar
Parsing. SOFSEM (1) (2007)
Martin Simunek, Borivoj Melichar
Borders and Finite Automata. Int. J. Found. Comput. Sci. 18 (4) (2007)
Ladislav Vagner, Borivoj Melichar
Parallel LL parsing. Acta Informatica 44 (1) (2007)
Martin Simunek, Borivoj Melichar
Borders and Finite Automata. CIAA (2006)
Jan Supol, Borivoj Melichar
A New Approach to Determinisation Using Bit-Parallelism. ICTAC (2006)
Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo
Finding Common Motifs with Gaps Using Finite Automata. CIAA (2006)
Jan Supol, Borivoj Melichar
Two-dimensional bitwise memory matrix: A tool for optimal parallel approximate pattern matching. Stringology (2006)
Jan Lahoda, Borivoj Melichar
General pattern matching on regular collage system. Stringology (2005)
Jan Supol, Borivoj Melichar
Arithmetic coding in parallel. Int. J. Found. Comput. Sci. 16 (6) (2005)
Jan Zdárek, Borivoj Melichar
On Two-Dimensional Pattern Matching by Finite Automata. CIAA (2005)
Jan Antos, Borivoj Melichar
Backward pattern matching automaton. Stringology (2005)
Tomás Polcar, Borivoj Melichar
Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata. CIAA (2004)
Jan Supol, Borivoj Melichar
Arithmetic Coding in Parallel. Stringology (2004)
Borivoj Melichar, Tomás Polcar
The Longest Common Subsequence Problem A Finite Automata Approach. CIAA (2003)
Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek
Directed acyclic subsequence graph - Overview. J. Discrete Algorithms 1 (3-4) (2003)
Borivoj Melichar, Milan Simánek
Operation L-INSERT on Factor Automaton. Stringology (2003)
Borivoj Melichar, Nguyen Van Bac
Transformations of grammars and translation directed by LR parsing. Kybernetika 38 (1) (2002)
Borivoj Melichar
Deterministic Parsing of Cyclic Strings. CIAA (2002)
John Aycock, R. Nigel Horspool, Jan Janousek, Borivoj Melichar
Even faster generalized LR parsing. Acta Informatica 37 (9) (2001)
Borivoj Melichar, Jan Skryja
On the Size of Deterministic Finite Automata. CIAA (2001)
Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard
Distributed Pattern Matching Using Finite Automata. J. Autom. Lang. Comb. 6 (2) (2001)
Jan Holub, Borivoj Melichar
Approximate string matching using factor automata. Theor. Comput. Sci. 249 (2) (2000)
Zdenek Tronícek, Borivoj Melichar
Directed Acyclic Subsequence Graph. Stringology (1998)
Jan Holub, Borivoj Melichar
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. Workshop on Implementing Automata (1998)
Jan Janousek, Borivoj Melichar
Formal Translations Described by Translation Grammars with LR(k) Input Grammars. PLILP (1997)
Jan Janousek, Borivoj Melichar
The Output-Store Formal Translator Directed by LR Parsing. SOFSEM (1997)
Borivoj Melichar, Jan Holub
6D Classification of Pattern Matching Problems. Stringology (1997)
Borivoj Melichar
Space Complexity of Linear Time Approximate String Matching. Stringology (1996)
Borivoj Melichar
String matching with k differences by finite automata. ICPR (1996)
Borivoj Melichar
Approximate String Matching by Finite Automata. CAIP (1995)
Borivoj Melichar
Transformations of translation grammars. Kybernetika 30 (1) (1994)
Borivoj Melichar
Syntax Directed Translation with LR Parsing. CC (1992)
Borivoj Melichar
Formal translation directed by LR parsing. Kybernetika 28 (1) (1992)
Rieks op den Akker, Borivoj Melichar, Jorma Tarhio
Attribute Evaluation and Parsing. Attribute Grammars, Applications and Systems (1991)
Rieks op den Akker, Borivoj Melichar, Jorma Tarhio
The Hierarchy of LR-Attributed Grammars. WAGA (1990)