Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,569 papers from all fields of science
Search
Sign In
Create Free Account
Deterministic acyclic finite state automaton
Known as:
Acyclic deterministic finite automaton
, Compact DAWG
, Acyclic deterministic finite automata
Expand
In computer science, a deterministic acyclic finite state automaton (DAFSA),also called a directed acyclic word graph (DAWG; though that name also…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Computer science
DFA minimization
Data structure
Directed acyclic graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Induction of Directed Acyclic Word Graph in a Bioinformatics Task
Wojciech Wieczorek
,
O. Unold
International Conference on Graphics and…
2014
Corpus ID: 1927097
In this paper a new algorithm for the induction of a Directed Acyclic Word Graph (DAWG) is proposed. A DAWG can serve as a very…
Expand
2013
2013
Symmetric searchable encryption for exact pattern matching using directed Acyclic Word Graphs
Rolf Haynberg
,
Jochen Rill
,
Dirk Achenbach
,
J. Müller-Quade
International Conference on Security and…
2013
Corpus ID: 10132143
Searchable Encryption schemes allow searching within encrypted data without prior decryption. Various index-based schemes have…
Expand
2012
2012
Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding
Jun-ichi Yamamoto
,
H. Bannai
,
Shunsuke Inenaga
,
Masayuki Takeda
arXiv.org
2012
Corpus ID: 18133962
We propose a new approach for calculating the Lempel-Ziv factorization of a string, based on run length encoding (RLE). We…
Expand
2010
2010
Software maintenance by multi-patterns parameterized string matching with q-gram
K. Kumar
,
R. Prasad
,
S. Agarwal
SOEN
2010
Corpus ID: 6785761
In the multi-patterns parameterized string matching problem, a set of patterns P0, P1, P2...Pr-1, r≥1, are said to match with a…
Expand
2006
2006
Sparse compact directed acyclic word graphs
Shunsuke Inenaga
,
Masayuki Takeda
Prague Stringology Conference
2006
Corpus ID: 10432478
The suffix tree of string w represents all suffixes of w, and thus it supports full indexing of w for exact pattern matching. On…
Expand
2004
2004
A Trie-Based Approach for Compacting Automata
M. Crochemore
,
Chiara Epifanio
,
R. Grossi
,
F. Mignosi
Annual Symposium on Combinatorial Pattern…
2004
Corpus ID: 12771155
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from…
Expand
2003
2003
A New Recursive Incremental Algorithm for Building Minimal Acyclic Deterministic Finite Automata
B. Watson
Grammars and Automata for String Processing
2003
Corpus ID: 9541887
This chapter presents a new algorithm for incrementally building minimal acyclic deterministic finite automata. Such minimal…
Expand
2002
2002
DAWG versus suffix array
Miroslav Balík
International Conference on Implementation and…
2002
Corpus ID: 31757792
This paper shows a comparison of two data structures used for indexing of input texts. The first structure is the Suffix Array…
Expand
2002
2002
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
B. Watson
Journal of universal computer science (Online)
2002
Corpus ID: 20428032
In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a…
Expand
1998
1998
A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs
B. Watson
Workshop on Implementing Automata
1998
Corpus ID: 43397751
We present a semi-incremental algorithm for constructing minimal acyclic deterministic finite automata. Such automata are useful…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE