Directed acyclic word graph
Wikimedia disambiguation page
≈ 1 min read
Directed acyclic word graph. encyclopegia.org, snapshot directed-acyclic-word-graph-601496-467df56e0776fae5. /a/directed-acyclic-word-graph
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.