Borivoj Melichar

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