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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

In this paper, we consider fully-online construction of indexing data structures for multiple texts. Let $T = {T_1, ..., T_K}$ be…

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…

2011

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

The suffix tree of string w is a text indexing structure that represents all suffixes of w. A sparse suffix tree of w represents…

2004

We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from…

2003

This chapter presents a new algorithm for incrementally building minimal acyclic deterministic finite automata. Such minimal…

2002

In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a…

2002

This paper shows a comparison of two data structures used for indexing of input texts. The first structure is the Suffix Array…

1998

We present a semi-incremental algorithm for constructing minimal acyclic deterministic finite automata. Such automata are useful…