Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00985351n
Noun Concept
Categories: All articles needing additional references, Finite automata
EN
DFA minimization  Automaton minimization  Finite state machine minimization  minimal automaton  minimal deterministic finite state machine
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
Definitions
Relations
Sources
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
IS A
undertaking
Wikipedia
EN
DFA minimization
Wikidata
EN
DFA minimization
Wikipedia Redirections
EN
Automaton minimization, Dfa minimization, Finite state machine minimization, minimal automaton, minimal deterministic finite state machine, minimal DFA, Minimized dfa, minimizing deterministic finite automaton

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