default search action
Borivoj Melichar
Person information
- affiliation: Czech Technical University in Prague, Faculty of Information Technology, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j22]Jan Trávnícek
, Jan Janousek
On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees. Theor. Comput. Sci. 830-831: 60-90 (2020)
2010 – 2019
- 2018
- [c44]Eliska Sestáková, Borivoj Melichar, Jan Janousek:
Constrained Approximate Subtree Matching by Finite Automata. Stringology 2018: 79-90 - 2016
- [j21]Radomír Polách
Efficient determinization of visibly and height-deterministic pushdown automata. Comput. Lang. Syst. Struct. 46: 91-105 (2016) - 2015
- [c43]Radomír Polách
A new algorithm for the determinisation of visibly pushdown automata. FedCSIS 2015: 915-922 - [c42]Jan Trávnícek
Backward Linearised Tree Pattern Matching. LATA 2015: 599-610 - 2014
- [c41]Jan Janousek
A Full and Linear Index of a Tree for Tree Patterns. DCFS 2014: 198-209 - 2013
- [j20]Michalis Christou, Tomás Flouri
Tree template matching in unranked ordered trees. J. Discrete Algorithms 20: 51-60 (2013) - [c40]Borivoj Melichar:
Graphs and Automata. Stringology 2013: 1-6 - 2012
- [j19]Jan Travnicek
Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata. Comput. Sci. Inf. Syst. 9(3): 1125-1153 (2012) - [j18]Michalis Christou, Maxime Crochemore
Computing all subtree repeats in ordered trees. Inf. Process. Lett. 112(24): 958-962 (2012) - [j17]Tomás Flouri
Tree template matching in ranked ordered trees by pushdown automata. J. Discrete Algorithms 17: 15-23 (2012) - [j16]Borivoj Melichar, Jan Janousek, Tomás Flouri:
Arbology: Trees and pushdown automata. Kybernetika 48(3): 402-428 (2012) - [j15]Jan Janousek, Borivoj Melichar, Martin Poliak:
Tree compression pushdown automaton. Kybernetika 48(3): 429-452 (2012) - 2011
- [j14]Jan Zdárek, Borivoj Melichar:
Tree-Based 2D Indexing. Int. J. Found. Comput. Sci. 22(8): 1893-1907 (2011) - [c39]Jan Travnicek, Jan Janousek, Borivoj Melichar:
Nonlinear Tree Pattern Pushdown Automata. FedCSIS 2011: 871-878 - [c38]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis:
Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS 2011: 899-902 - [c37]Martin Plicka, Jan Janousek, Borivoj Melichar:
Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. FedCSIS 2011: 903-906 - [c36]Michalis Christou, Maxime Crochemore, Tomás Flouri
Computing All Subtree Repeats in Ordered Ranked Trees. SPIRE 2011: 338-343 - [c35]Tomás Flouri, Jan Janousek
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. CIAA 2011: 273-281 - 2010
- [j13]Tomás Flouri
Subtree matching by pushdown automata. Comput. Sci. Inf. Syst. 7(2): 331-357 (2010) - [c34]Borivoj Melichar:
Arbology: Trees and Pushdown Automata. LATA 2010: 32-49 - [c33]Tomás Flouri
Aho-Corasick like multiple subtree matching by pushdown automata. SAC 2010: 2157-2158 - [c32]Jan Antos, Borivoj Melichar:
Finite Automata for Generalized Approach to Backward Pattern Matching. CIAA 2010: 49-58 - [c31]Jan Zdárek, Borivoj Melichar:
A Note on a Tree-Based 2D Indexing. CIAA 2010: 300-309
2000 – 2009
- 2009
- [j12]Jan Janousek
On regular tree languages and deterministic pushdown automata. Acta Informatica 46(7): 533-547 (2009) - [c30]Tomás Flouri
Subtree matching by deterministic pushdown automata. IMCSIT 2009: 659-666 - 2008
- [c29]Ondrej Guth, Borivoj Melichar, Miroslav Balík:
Searching all approximate covers and their distance using finite automata. ITAT 2008 - [c28]Jan Lahoda, Borivoj Melichar, Jan Zdárek:
Pattern Matching in DCA Coded Text. CIAA 2008: 151-160 - [c27]Martin Simunek, Borivoj Melichar:
Approximate Periods with Levenshtein Distance. CIAA 2008: 286-287 - 2007
- [j11]Ladislav Vagner, Borivoj Melichar:
Parallel LL parsing. Acta Informatica 44(1): 1-21 (2007) - [j10]Ladislav Vagner, Borivoj Melichar:
Parallel LL parsing. Acta Informatica 44(1): 73 (2007) - [j9]Martin Simunek, Borivoj Melichar:
Borders and Finite Automata. Int. J. Found. Comput. Sci. 18(4): 859-871 (2007) - [c26]Costas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol:
Weighted Degenerated Approximate Pattern Matching. LATA 2007: 285-296 - [c25]Ladislav Vagner, Borivoj Melichar:
Formal Translation Directed by Parallel LLP Parsing. SOFSEM (1) 2007: 532-543 - 2006
- [c24]Jan Supol, Borivoj Melichar:
A New Approach to Determinisation Using Bit-Parallelism. ICTAC 2006: 228-241 - [c23]Jan Supol, Borivoj Melichar:
Two-dimensional bitwise memory matrix: A tool for optimal parallel approximate pattern matching. Stringology 2006: 18-28 - [c22]Martin Simunek, Borivoj Melichar:
Borders and Finite Automata. CIAA 2006: 58-68 - [c21]Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo:
Finding Common Motifs with Gaps Using Finite Automata. CIAA 2006: 69-77 - 2005
- [j8]Jan Supol, Borivoj Melichar:
Arithmetic coding in parallel. Int. J. Found. Comput. Sci. 16(6): 1207-1217 (2005) - [c20]Jan Antos, Borivoj Melichar:
Backward pattern matching automaton. Stringology 2005: 81-94 - [c19]Jan Lahoda, Borivoj Melichar:
General pattern matching on regular collage system. Stringology 2005: 153-162 - [c18]Jan Zdárek, Borivoj Melichar:
On Two-Dimensional Pattern Matching by Finite Automata. CIAA 2005: 329-340 - 2004
- [c17]Jan Supol, Borivoj Melichar:
Arithmetic Coding in Parallel. Stringology 2004: 168-187 - [c16]Tomás Polcar, Borivoj Melichar:
Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata. CIAA 2004: 327-328 - 2003
- [j7]Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek:
Directed acyclic subsequence graph - Overview. J. Discrete Algorithms 1(3-4): 255-280 (2003) - [c15]Borivoj Melichar, Milan Simánek:
Operation L-INSERT on Factor Automaton. Stringology 2003: 111-126 - [c14]Borivoj Melichar, Tomás Polcar:
The Longest Common Subsequence Problem A Finite Automata Approach. CIAA 2003: 294-296 - 2002
- [j6]Borivoj Melichar, Nguyen Van Bac:
Transformations of grammars and translation directed by LR parsing. Kybernetika 38(1): 13-44 (2002) - [c13]Borivoj Melichar:
Deterministic Parsing of Cyclic Strings. CIAA 2002: 301-306 - 2001
- [j5]John Aycock, R. Nigel Horspool, Jan Janousek
Even faster generalized LR parsing. Acta Informatica 37(9): 633-651 (2001) - [j4]Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard:
Distributed Pattern Matching Using Finite Automata. J. Autom. Lang. Comb. 6(2): 191-201 (2001) - [c12]Borivoj Melichar, Jan Skryja:
On the Size of Deterministic Finite Automata. CIAA 2001: 202-213 - 2000
- [j3]Jan Holub
Approximate string matching using factor automata. Theor. Comput. Sci. 249(2): 305-311 (2000)
1990 – 1999
- 1998
- [c11]Zdenek Tronícek, Borivoj Melichar:
Directed Acyclic Subsequence Graph. Stringology 1998: 107-118 - [c10]Jan Holub
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching. Workshop on Implementing Automata 1998: 92-99 - 1997
- [c9]Jan Janousek
Formal Translations Described by Translation Grammars with LR(k) Input Grammars. PLILP 1997: 421-422 - [c8]Jan Janousek
The Output-Store Formal Translator Directed by LR Parsing. SOFSEM 1997: 432-439 - [c7]Borivoj Melichar, Jan Holub:
6D Classification of Pattern Matching Problems. Stringology 1997: 24-32 - 1996
- [c6]Borivoj Melichar:
String matching with k differences by finite automata. ICPR 1996: 256-260 - [c5]Borivoj Melichar:
Space Complexity of Linear Time Approximate String Matching. Stringology 1996: 28-36 - 1995
- [c4]Borivoj Melichar:
Approximate String Matching by Finite Automata. CAIP 1995: 342-349 - 1994
- [j2]Borivoj Melichar:
Transformations of translation grammars. Kybernetika 30(1): 53-62 (1994) - 1992
- [j1]Borivoj Melichar:
Formal translation directed by LR parsing. Kybernetika 28(1): 50-61 (1992) - [c3]Borivoj Melichar:
Syntax Directed Translation with LR Parsing. CC 1992: 30-36 - 1991
- [c2]Rieks op den Akker, Borivoj Melichar, Jorma Tarhio
Attribute Evaluation and Parsing. Attribute Grammars, Applications and Systems 1991: 187-214 - [e1]Henk Alblas, Borivoj Melichar:
Attribute Grammars, Applications and Systems, International Summer School SAGA, Prague, Czechoslovakia, June 4-13, 1991, Proceedings. Lecture Notes in Computer Science 545, Springer 1991, ISBN 3-540-54572-7 [contents] - 1990
- [c1]Rieks op den Akker, Borivoj Melichar, Jorma Tarhio
The Hierarchy of LR-Attributed Grammars. WAGA 1990: 13-28
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: