Borivoj Melichar

According to our database, Borivoj Melichar authored at least 62 papers between 1990 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

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

2018

Constrained Approximate Subtree Matching by Finite Automata.

Eliska Sestáková, Borivoj Melichar, Jan Janousek

Proceedings of the Prague Stringology Conference 2018, 2018

2016

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

2015

Backward Linearised Tree Pattern Matching.

Jan Trávnícek, Jan Janousek, Borivoj Melichar, Loek G. Cleophas

Proceedings of the Language and Automata Theory and Applications, 2015

A new algorithm for the determinisation of visibly pushdown automata.

Radomír Polách, Jan Travnicek, Jan Janousek, Borivoj Melichar

Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 2015

2014

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

Proceedings of the Descriptional Complexity of Formal Systems, 2014

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

Graphs and Automata.

Borivoj Melichar

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

2012

Arbology: Trees and pushdown automata.

Borivoj Melichar, Jan Janousek, Tomás Flouri

Kybernetika, 2012

Tree compression pushdown automaton.

Jan Janousek, Borivoj Melichar, Martin Poliak

Kybernetika, 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

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

Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata.

Jan Travnicek, Jan Janousek, Borivoj Melichar

Comput. Sci. Inf. Syst., 2012

2011

Tree-Based 2D Indexing.

Jan Zdárek, Borivoj Melichar

Int. J. Found. Comput. Sci., 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

Proceedings of the String Processing and Information Retrieval, 2011

Nonlinear Tree Pattern Pushdown Automata.

Jan Travnicek, Jan Janousek, Borivoj Melichar

Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees.

Martin Plicka, Jan Janousek, Borivoj Melichar

Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

Tree Indexing by Pushdown Automata and Repeats of Subtrees.

Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis

Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

2010

Subtree matching by pushdown automata.

Tomás Flouri, Jan Janousek, Borivoj Melichar

Comput. Sci. Inf. Syst., 2010

A Note on a Tree-Based 2D Indexing.

Jan Zdárek, Borivoj Melichar

Proceedings of the Implementation and Application of Automata, 2010

Finite Automata for Generalized Approach to Backward Pattern Matching.

Jan Antos, Borivoj Melichar

Proceedings of the Implementation and Application of Automata, 2010

Aho-Corasick like multiple subtree matching by pushdown automata.

Tomás Flouri, Borivoj Melichar, Jan Janousek

Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Arbology: Trees and Pushdown Automata.

Borivoj Melichar

Proceedings of the Language and Automata Theory and Applications, 2010

2009

On regular tree languages and deterministic pushdown automata.

Jan Janousek, Borivoj Melichar

Acta Informatica, 2009

Subtree matching by deterministic pushdown automata.

Tomás Flouri, Borivoj Melichar, Jan Janousek

Proceedings of the International Multiconference on Computer Science and Information Technology, 2009

2008

Approximate Periods with Levenshtein Distance.

Martin Simunek, Borivoj Melichar

Proceedings of the Implementation and Applications of Automata, 2008

Pattern Matching in DCA Coded Text.

Jan Lahoda, Borivoj Melichar, Jan Zdárek

Proceedings of the Implementation and Applications of Automata, 2008

Searching all approximate covers and their distance using finite automata.

Ondrej Guth, Borivoj Melichar, Miroslav Balík

Proceedings of the Conference on Theory and Practice of Information Technologies, 2008

2007

Borders and Finite Automata.

Martin Simunek, Borivoj Melichar

Int. J. Found. Comput. Sci., 2007

Parallel LL parsing.

Ladislav Vagner, Borivoj Melichar

Acta Informatica, 2007

Formal Translation Directed by Parallel <i>LLP</i> Parsing.

Ladislav Vagner, Borivoj Melichar

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Weighted Degenerated Approximate Pattern Matching.

Costas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006

Finding Common Motifs with Gaps Using Finite Automata.

Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo

Proceedings of the Implementation and Application of Automata, 2006

Two-dimensional bitwise memory matrix: A tool for optimal parallel approximate pattern matching.

Jan Supol, Borivoj Melichar

Proceedings of the Prague Stringology Conference, 2006

A New Approach to Determinisation Using Bit-Parallelism.

Jan Supol, Borivoj Melichar

Proceedings of the Theoretical Aspects of Computing, 2006

2005

Arithmetic coding in parallel.

Jan Supol, Borivoj Melichar

Int. J. Found. Comput. Sci., 2005

On Two-Dimensional Pattern Matching by Finite Automata.

Jan Zdárek, Borivoj Melichar

Proceedings of the Implementation and Application of Automata, 2005

General pattern matching on regular collage system.

Jan Lahoda, Borivoj Melichar

Proceedings of the Prague Stringology Conference, 2005

Backward pattern matching automaton.

Jan Antos, Borivoj Melichar

Proceedings of the Prague Stringology Conference, 2005

2004

Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata.

Tomás Polcar, Borivoj Melichar

Proceedings of the Implementation and Application of Automata, 2004

2003

Directed acyclic subsequence graph - Overview.

Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek

J. Discrete Algorithms, 2003

The Longest Common Subsequence Problem A Finite Automata Approach.

Borivoj Melichar, Tomás Polcar

Proceedings of the Implementation and Application of Automata, 2003

Operation L-INSERT on Factor Automaton.

Borivoj Melichar, Milan Simánek

Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003

2002

Transformations of grammars and translation directed by LR parsing.

Borivoj Melichar, Nguyen Van Bac

Kybernetika, 2002

Deterministic Parsing of Cyclic Strings.

Borivoj Melichar

Proceedings of the Implementation and Application of Automata, 2002

2001

Distributed Pattern Matching Using Finite Automata.

Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard

J. Autom. Lang. Comb., 2001

Even faster generalized LR parsing.

John Aycock, R. Nigel Horspool, Jan Janousek, Borivoj Melichar

Acta Informatica, 2001

On the Size of Deterministic Finite Automata.

Borivoj Melichar, Jan Skryja

Proceedings of the Implementation and Application of Automata, 2001

2000

Approximate string matching using factor automata.

Jan Holub, Borivoj Melichar

Theor. Comput. Sci., 2000

1998

Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching.

Jan Holub, Borivoj Melichar

Proceedings of the Automata Implementation, 1998

Directed Acyclic Subsequence Graph.

Zdenek Tronícek, Borivoj Melichar

Proceedings of the Prague Stringology Club Workshop 1998, Prague, Czech Republic, 1998

1997

6D Classification of Pattern Matching Problems.

Borivoj Melichar, Jan Holub

Proceedings of the Prague Stringology Club Workshop 1997, 1997

The Output-Store Formal Translator Directed by LR Parsing.

Jan Janousek, Borivoj Melichar

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Formal Translations Described by Translation Grammars with LR(k) Input Grammars.

Jan Janousek, Borivoj Melichar

Proceedings of the Programming Languages: Implementations, 1997

1996

Space Complexity of Linear Time Approximate String Matching.

Borivoj Melichar

Proceedings of the Prague Stringology Club Workshop 1996, 1996

String matching with k differences by finite automata.

Borivoj Melichar

Proceedings of the 13th International Conference on Pattern Recognition, 1996

1995

Approximate String Matching by Finite Automata.

Borivoj Melichar

Proceedings of the Computer Analysis of Images and Patterns, 6th International Conference, 1995

1994

Transformations of translation grammars.

Borivoj Melichar

Kybernetika, 1994

1992

Formal translation directed by LR parsing.

Borivoj Melichar

Kybernetika, 1992

Syntax Directed Translation with LR Parsing.

Borivoj Melichar

Proceedings of the Compiler Construction, 1992

1991

Attribute Evaluation and Parsing.

Rieks op den Akker, Borivoj Melichar, Jorma Tarhio

Proceedings of the Attribute Grammars, 1991

1990

The Hierarchy of LR-Attributed Grammars.

Rieks op den Akker, Borivoj Melichar, Jorma Tarhio

Proceedings of the Attribute Grammars and their Applications, 1990