Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00985351n
Noun Concept
SYL
No term available
EN
In automata theory, DFA minimization is the task of transforming a given deterministic finite automaton into an equivalent DFA that has a minimum number of states. Wikipedia
Relations
Sources
IS A
EN
undertaking

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