Matches in DBpedia 2016-04 for { ?s ?p "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."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Deterministic_acyclic_finite_state_automaton 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 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.".