Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q17008992> ?p ?o }
Showing triples 1 to 25 of
25
with 100 triples per page.
- Q17008992 subject Q8498905.
- Q17008992 subject Q8819517.
- Q17008992 abstract "In computer science, a deterministic acyclic finite state automaton (DAFSA),also called a directed acyclic word graph (DAWG; though that name also refers to a related data structure that functions as a suffix index)is a data structure that represents a set of strings, and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length. Algorithms exist to construct and maintain such automata, while keeping them minimal.A DAFSA is a special case of a finite state recognizer that takes the form of a directed acyclic graph with a single source vertex (a vertex with no incoming edges), in which each edge of the graph is labeled by a letter or symbol, and in which each vertex has at most one outgoing edge for each possible letter or symbol. The strings represented by the DAFSA are formed by the symbols on paths in the graph from the source vertex to any sink vertex (a vertex with no outgoing edges). In fact, a deterministic finite state automaton is acyclic if and only if it recognizes a finite set of strings.".
- Q17008992 thumbnail Trie-vs-minimal-acyclic-fa.svg?width=300.
- Q17008992 wikiPageExternalLink cwg.html.
- Q17008992 wikiPageExternalLink dawg.html.
- Q17008992 wikiPageExternalLink scrabble.pdf.
- Q17008992 wikiPageWikiLink Q1195339.
- Q17008992 wikiPageWikiLink Q175263.
- Q17008992 wikiPageWikiLink Q176452.
- Q17008992 wikiPageWikiLink Q176916.
- Q17008992 wikiPageWikiLink Q184754.
- Q17008992 wikiPageWikiLink Q19599738.
- Q17008992 wikiPageWikiLink Q21198.
- Q17008992 wikiPageWikiLink Q387015.
- Q17008992 wikiPageWikiLink Q5204896.
- Q17008992 wikiPageWikiLink Q752532.
- Q17008992 wikiPageWikiLink Q837528.
- Q17008992 wikiPageWikiLink Q8498905.
- Q17008992 wikiPageWikiLink Q8819517.
- Q17008992 wikiPageWikiLink Q924044.
- Q17008992 wikiPageWikiLink Q949972.
- Q17008992 comment "In computer science, a deterministic acyclic finite state automaton (DAFSA),also called a directed acyclic word graph (DAWG; though that name also refers to a related data structure that functions as a suffix index)is a data structure that represents a set of strings, and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length.".
- Q17008992 label "Deterministic acyclic finite state automaton".
- Q17008992 depiction Trie-vs-minimal-acyclic-fa.svg.