Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:16044195n
Noun Concept
Categories: Finite automata, String data structures, Graph data structures
EN
deterministic acyclic finite state automaton  Acyclic deterministic finite automata  Acyclic deterministic finite automaton  Compact DAWG  DAFSA
EN
In computer science, a deterministic acyclic finite state automaton, also called a directed acyclic word graph 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. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a deterministic acyclic finite state automaton, also called a directed acyclic word graph 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. Wikipedia
A data structure that represents a finite set of strings Wikipedia Disambiguation
Computer data structure that represents a finite set of strings Wikidata
IS A
deterministic finite automaton
Wikipedia
EN
deterministic acyclic finite state automaton
Wikidata
EN
deterministic acyclic finite state automaton
Wikipedia Redirections
EN
Acyclic deterministic finite automata, Acyclic deterministic finite automaton, Compact DAWG, DAFSA

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License