Filtry
DAWG Automaton versus Suffix Array
Not available...
JC - Počítačový hardware a software
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
DAWG versus Suffix Array
This paper shows a comparison of two data structures used for indexing of input texts. The first structure is the Suffix Array and the second is the Directed Acyclic Word Graph (DAWG). We present an efficient DAWG implementation and the ...
JC - Počítačový hardware a software
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
Searching for Regularities in Generalized Strings using Finite Automata
Searching for Regularities in Generalized Strings using Finite Automata.
IN - Informatika
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching
Given a deterministic finite automaton (DFA) A, we present a simple algorithm, the shortest forbidden suffixes, the shortest allowed suffixes, and the shortest forbidden of automaton A. If the given automaton
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2024 •
- D •
- Odkaz
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Borders and Finite Automata
suffix. It is one of the basic stringology keystones used as a part of many that ALL_BORDERS algorithm is a simulator of a finite automaton together with explaining the function ofthe automaton. We show that the simulated ...
IN - Informatika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Searching for Regularities in Strings using Finite Automata
New algorithms for searching repetetive structures and for pattern matching in DNA are presented. Methods are based on use of finite automata .
IN - Informatika
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
String Suffix Automata and Subtree Pushdown Automata
String suffix automata accept all suffixes of a given string and belong to the fundamental stringology principles. Extending their transitions by specific pushdown of a given subject tree in prefix notation and are analogous to th...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2009 •
- D
Rok uplatnění
D - Stať ve sborníku
The Finite Automata Approaches in Stringology
We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation,...
IN - Informatika
- 2012 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Communication of two stacks and rewriting
Rewriting systems working on words with a center marker are considered. The derivation is done by erasing a prefix or a suffix and then adding a prefix or a suffix. This can be naturally viewed as two stacks communicating with each ...
BA - Obecná matematika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
A New Approach to Determinisation Using Bit-Parallelism
, or accepted by the suffix automaton, respectively. introduce the determinisation of suffix automata. This new approach speeds......
IN - Informatika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 z 1 118