Directed acyclic word graph

Wikimedia disambiguation page

Uses your system voice; voice and rate in settings.

≈ 1 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

  • СрпскиUsmereni aciklički graf reči
  • EnglishDirected acyclic word graph

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Directed acyclic word graph (DAWG) may refer to two related, but distinct, automata constructions in computer science: * Deterministic acyclic finite state automaton, a data structure that represents a finite set of strings * Suffix automaton, a finite automaton that functions as a suffix index

Directed acyclic word graph (DAWG) may refer to two related, but distinct, automata constructions in computer science: Deterministic acyclic finite state automaton, a data structure that represents a finite set of strings Suffix automaton, a finite automaton that functions as a suffix index

Text derived from https://en.wikipedia.org/w/index.php?oldid=1311726543 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot directed-acyclic-word-graph-601496-467df56e0776fae5 · hash 467df56e0776fae5e17b7f42f990e49c06ab3b706f1c09985ed4ad91fb3b7376 · captured 2025-09-16 · ledger · version history

Cite this page as: encyclopegia.org, “Directed acyclic word graph”, snapshot directed-acyclic-word-graph-601496-467df56e0776fae5. https://encyclopegia.org/a/directed-acyclic-word-graph

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.