#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1990

2016

- This year (0)
- Last 5 years (10)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Zdenek Tronícek, Borivoj Melichar
- Stringology
- 1998

- John Aycock, R. Nigel Horspool, Jan Janousek, Borivoj Melichar
- Acta Informatica
- 2001

We prove a property of generalized LR (GLR) parsing – if the grammar is without right and hidden left recursions, then the number of consecutive reductions between the shifts of two adjacent symbols cannot be greater than a constant. Further, we show that this property can be used for constructing an optimized version of our GLR parser. Compared with a… (More)

- Jan Janousek, Borivoj Melichar
- Acta Informatica
- 2009

The theory of formal string languages and of formal tree languages are both important parts of the theory of formal languages. Regular tree languages are recognized by finite tree automata. Trees in their postfix notation can be seen as strings. This paper presents a simple transformation from any given (bottom-up) finite tree automaton recognizing a… (More)

- Borivoj Melichar
- ICPR
- 1996

- Borivoj Melichar
- CAIP
- 1995

Abs t r ac t . Approximate string matching is a sequential problem and therefore it is possible to solve it using finite automata. A nondeterministic finite automaton is constructed for string matching with k mismatches. It is shown, how "dynamic programming" and "shift-and" based algorithms simulate this nondeterministic finite automaton. The corresponding… (More)

- Rieks op den Akker, Borivoj Melichar, Jorma Tarhio
- WAGA
- 1990

The problem of attribute evaluation during LR parsing is considered. Several definitions of LR-attributed grammars are presented. Relations of corresponding attribute grammar classes are analysed. Also the relations between LR-attributed grammars and LL-attributed grammars and between LR-attributed grammars and a class of one-pass attributed grammars based… (More)

- Rieks op den Akker, Borivoj Melichar, Jorma Tarhio
- Attribute Grammars, Applications and Systems
- 1991

- Borivoj Melichar, Jan Holub
- Stringology
- 1997

- Maxime Crochemore, Borivoj Melichar, Zdenek Tronícek
- J. Discrete Algorithms
- 2003

The subsequence matching problem is to decide, for given strings S and T , whether S is a subsequence of T . The string S is called the pattern and the string T the text. We consider the case of multiple texts and show how to solve the subsequence matching problem in time linear in the length of the pattern. For this purpose we build an automaton that… (More)