#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1953

2010

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Costas S. Iliopoulos, Mohammad Sohel Rahman, Michal Vorácek, Ladislav Vagner
- J. Discrete Algorithms
- 2010

Article history: Received 8 January 2008 Accepted 1 October 2008 Available online 22 September 2009

- Ladislav Vagner, Borivoj Melichar
- Acta Informatica
- 2006

A deterministic parallel LL parsing algorithm is presented. The algorithm is based on a transformation from a parsing problem to parallel reduction. First, a nondeterministic version of a parallel LL parser is introduced. Then, it is transformed into the deterministic version—the LLP parser. The deterministic LLP(q,k) parser uses two kinds of information to… (More)

In this paper, we present the Truncated Generalized Suffix Automaton (TGSA) and present an efficient on-line algorithm for its construction. TGSA is a novel type of finite automaton suitable for indexing DNA and RNA sequences, where the text is degenerate i.e. contains sets of characters. TGSA indexes the so called k-factors, the factors of the degenerate… (More)

- L V VAGNER
- Voprosy pediatrii
- 1953

- Jan Žd’́arek, Gabriela Andrejková, +20 authors Niko Valimaki
- 2001

A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of edges of a directed graph is synchronizing if the coloring turns the graph into a deterministic finite automaton possessing a synchronizing word. The road coloring problem is the… (More)

- Ladislav Vagner, Borivoj Melichar
- SOFSEM
- 2007

- ‹
- 1
- ›