Skip to search formSkip to main contentSkip to account menu

Deterministic acyclic finite state automaton

Known as: Acyclic deterministic finite automaton, Compact DAWG, Acyclic deterministic finite automata 
In computer science, a deterministic acyclic finite state automaton (DAFSA),also called a directed acyclic word graph (DAWG; though that name also… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
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… 
2013
2013
Searchable Encryption schemes allow searching within encrypted data without prior decryption. Various index-based schemes have… 
2012
2012
We propose a new approach for calculating the Lempel-Ziv factorization of a string, based on run length encoding (RLE). We… 
2010
2010
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… 
2006
2006
The suffix tree of string w represents all suffixes of w, and thus it supports full indexing of w for exact pattern matching. On… 
2004
2004
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from… 
2003
2003
  • B. Watson
  • 2003
  • Corpus ID: 9541887
This chapter presents a new algorithm for incrementally building minimal acyclic deterministic finite automata. Such minimal… 
2002
2002
This paper shows a comparison of two data structures used for indexing of input texts. The first structure is the Suffix Array… 
2002
2002
  • B. Watson
  • 2002
  • Corpus ID: 20428032
In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a… 
1998
1998
  • B. Watson
  • 1998
  • Corpus ID: 43397751
We present a semi-incremental algorithm for constructing minimal acyclic deterministic finite automata. Such automata are useful…