Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:16044195n
Noun Concept
JA
No term available
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
Relations
Sources
IS A
決定性有限オートマトン

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