Travelled to:1 × Austria
1 × South Africa
1 × Switzerland
1 × Taiwan
1 × United Kingdom
2 × Canada
2 × Germany
2 × USA
6 × France
Collaborated with:∅ J.Zdárek M.Simunek J.Janousek T.Polcar J.Holub C.S.Iliopoulos T.Flouri J.Antos J.Skryja J.Lahoda R.o.d.Akker J.Tarhio J.Trávnícek L.G.Cleophas I.Jayasekera J.Supol S.P.Pissis P.Antoniou P.Peterlongo
Talks about:automata (13) match (10) finit (9) pattern (7) tree (6) dimension (3) translat (3) pushdown (3) approxim (3) grammar (3)
Person: Borivoj Melichar
DBLP: Melichar:Borivoj
Contributed to:
2015
2011201020112010
20102008200720062007200520042003200220011998
1997
1996
1992
1990Wrote 23 papers:
- LATA-2015-TravnicekJMC #pattern matching
- Backward Linearised Tree Pattern Matching (JT, JJ, BM, LGC), pp. 599–610.
- CIAA-2011-FlouriJMIP #automaton #order
- Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (TF, JJ, BM, CSI, SPP), pp. 273–281.
- CIAA-2010-AntosM #approach #automaton #finite #pattern matching
- Finite Automata for Generalized Approach to Backward Pattern Matching (JA, BM), pp. 49–58.
- CIAA-2010-ZdarekM #2d
- A Note on a Tree-Based 2D Indexing (JZ, BM), pp. 300–309.
- CIAA-J-2010-ZdarekM11 #2d
- Tree-Based 2D Indexing (JZ, BM), pp. 1893–1907.
- LATA-2010-Melichar #automaton #named
- Arbology: Trees and Pushdown Automata (BM), pp. 32–49.
- SAC-2010-FlouriMJ #automaton #multi
- Aho-Corasick like multiple subtree matching by pushdown automata (TF, BM, JJ), pp. 2157–2158.
- CIAA-2008-LahodaMZ #pattern matching
- Pattern Matching in DCA Coded Text (JL, BM, JZ), pp. 151–160.
- CIAA-2008-SimunekM #approximate #distance
- Approximate Periods with Levenshtein Distance (MS, BM), pp. 286–287.
- LATA-2007-IliopoulosJMS #approximate #pattern matching
- Weighted Degenerated Approximate Pattern Matching (CSI, IJ, BM, JS), pp. 285–296.
- CIAA-2006-AntoniouHIMP #automaton #finite #using
- Finding Common Motifs with Gaps Using Finite Automata (PA, JH, CSI, BM, PP), pp. 69–77.
- CIAA-2006-SimunekM #automaton #finite
- Borders and Finite Automata (MS, BM), pp. 58–68.
- CIAA-J-2006-SimunekM07 #automaton #finite
- Borders and Finite Automata (MS, BM), pp. 859–871.
- CIAA-2005-ZdarekM #2d #automaton #finite #on the #pattern matching
- On Two-Dimensional Pattern Matching by Finite Automata (JZ, BM), pp. 329–340.
- CIAA-2004-PolcarM #2d #automaton #online #pattern matching
- Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata (TP, BM), pp. 327–328.
- CIAA-2003-MelicharP #approach #automaton #finite #problem #sequence
- The Longest Common Subsequence Problem A Finite Automata Approach (BM, TP), pp. 294–296.
- CIAA-2002-Melichar #parsing #string
- Deterministic Parsing of Cyclic Strings (BM), pp. 301–306.
- CIAA-2001-MelicharS #automaton #finite #on the
- On the Size of Deterministic Finite Automata (BM, JS), pp. 202–213.
- WIA-1998-HolubM #approximate #automaton #finite #implementation #nondeterminism #pattern matching
- Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching (JH, BM), pp. 92–99.
- PLILP-1997-JanousekM #lr
- Formal Translations Described by Translation Grammars with LR(k) Input Grammars (JJ, BM), pp. 421–422.
- ICPR-1996-Melichar #automaton #difference #finite #string
- String matching with k differences by finite automata (BM), pp. 256–260.
- CC-1992-Melichar #lr #parsing #syntax
- Syntax Directed Translation with LR Parsing (BM), pp. 30–36.
- WAGA-1990-AkkerMT #attribute grammar
- The Hierarchy of LR-Attributed Grammars (RodA, BM, JT), pp. 13–28.