Borivoj Melichar

According to our database1, Borivoj Melichar
  • authored at least 63 papers between 1990 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Efficient determinization of visibly and height-deterministic pushdown automata.
Computer Languages, Systems & Structures, 2016

2015
Backward Linearised Tree Pattern Matching.
Proceedings of the Language and Automata Theory and Applications, 2015

A new algorithm for the determinisation of visibly pushdown automata.
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.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013
Tree template matching in unranked ordered trees.
J. Discrete Algorithms, 2013

Graphs and Automata.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

2012
Arbology: Trees and pushdown automata.
Kybernetika, 2012

Tree compression pushdown automaton.
Kybernetika, 2012

Tree template matching in ranked ordered trees by pushdown automata.
J. Discrete Algorithms, 2012

Computing all subtree repeats in ordered trees.
Inf. Process. Lett., 2012

Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata.
Comput. Sci. Inf. Syst., 2012

2011
Tree-Based 2D Indexing.
Int. J. Found. Comput. Sci., 2011

Tree Template Matching in Ranked Ordered Trees by Pushdown Automata.
Proceedings of the Implementation and Application of Automata, 2011

Computing All Subtree Repeats in Ordered Ranked Trees.
Proceedings of the String Processing and Information Retrieval, 2011

Nonlinear Tree Pattern Pushdown Automata.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

Tree Indexing by Pushdown Automata and Repeats of Subtrees.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

2010
Subtree matching by pushdown automata.
Comput. Sci. Inf. Syst., 2010

A Note on a Tree-Based 2D Indexing.
Proceedings of the Implementation and Application of Automata, 2010

Finite Automata for Generalized Approach to Backward Pattern Matching.
Proceedings of the Implementation and Application of Automata, 2010

Aho-Corasick like multiple subtree matching by pushdown automata.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Arbology: Trees and Pushdown Automata.
Proceedings of the Language and Automata Theory and Applications, 2010

2009
On regular tree languages and deterministic pushdown automata.
Acta Inf., 2009

Subtree matching by deterministic pushdown automata.
Proceedings of the International Multiconference on Computer Science and Information Technology, 2009

2008
Approximate Periods with Levenshtein Distance.
Proceedings of the Implementation and Applications of Automata, 2008

Pattern Matching in DCA Coded Text.
Proceedings of the Implementation and Applications of Automata, 2008

2007
Borders and Finite Automata.
Int. J. Found. Comput. Sci., 2007

Parallel LL parsing.
Acta Inf., 2007

Parallel LL parsing.
Acta Inf., 2007

Formal Translation Directed by Parallel LLP Parsing.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Weighted Degenerated Approximate Pattern Matching.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006
Borders and Finite Automata.
Proceedings of the Implementation and Application of Automata, 2006

Finding Common Motifs with Gaps Using Finite Automata.
Proceedings of the Implementation and Application of Automata, 2006

Two-dimensional bitwise memory matrix: A tool for optimal parallel approximate pattern matching.
Proceedings of the Prague Stringology Conference, 2006

A New Approach to Determinisation Using Bit-Parallelism.
Proceedings of the Theoretical Aspects of Computing, 2006

2005
Arithmetic coding in parallel.
Int. J. Found. Comput. Sci., 2005

On Two-Dimensional Pattern Matching by Finite Automata.
Proceedings of the Implementation and Application of Automata, 2005

General pattern matching on regular collage system.
Proceedings of the Prague Stringology Conference, 2005

Backward pattern matching automaton.
Proceedings of the Prague Stringology Conference, 2005

2004
Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata.
Proceedings of the Implementation and Application of Automata, 2004

Arithmetic Coding in Parallel.
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

2003
Directed acyclic subsequence graph - Overview.
J. Discrete Algorithms, 2003

The Longest Common Subsequence Problem A Finite Automata Approach.
Proceedings of the Implementation and Application of Automata, 2003

Operation L-INSERT on Factor Automaton.
Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003

2002
Transformations of grammars and translation directed by LR parsing.
Kybernetika, 2002

Deterministic Parsing of Cyclic Strings.
Proceedings of the Implementation and Application of Automata, 2002

2001
Distributed Pattern Matching Using Finite Automata.
Journal of Automata, Languages and Combinatorics, 2001

Even faster generalized LR parsing.
Acta Inf., 2001

On the Size of Deterministic Finite Automata.
Proceedings of the Implementation and Application of Automata, 2001

2000
Approximate string matching using factor automata.
Theor. Comput. Sci., 2000

1998
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching.
Proceedings of the Automata Implementation, 1998

Directed Acyclic Subsequence Graph.
Proceedings of the Prague Stringology Club Workshop 1998, Prague, Czech Republic, 1998

1997
6D Classification of Pattern Matching Problems.
Proceedings of the Prague Stringology Club Workshop 1997, 1997

The Output-Store Formal Translator Directed by LR Parsing.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Formal Translations Described by Translation Grammars with LR(k) Input Grammars.
Proceedings of the Programming Languages: Implementations, 1997

1996
Space Complexity of Linear Time Approximate String Matching.
Proceedings of the Prague Stringology Club Workshop 1996, 1996

String matching with k differences by finite automata.
Proceedings of the 13th International Conference on Pattern Recognition, 1996

1995
Approximate String Matching by Finite Automata.
Proceedings of the Computer Analysis of Images and Patterns, 6th International Conference, 1995

1994
Transformations of translation grammars.
Kybernetika, 1994

1992
Formal translation directed by LR parsing.
Kybernetika, 1992

Syntax Directed Translation with LR Parsing.
Proceedings of the Compiler Construction, 1992

1991
Attribute Evaluation and Parsing.
Proceedings of the Attribute Grammars, 1991

1990
The Hierarchy of LR-Attributed Grammars.
Proceedings of the Attribute Grammars and their Applications, 1990


  Loading...