DFA minimization

In automata theory (a branch of computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states. Here, two DFAs are called equivalent if they recognize the same regular language. Several different algorithms accomplishing this task are known and described in standard textbooks on automata theory.

单词	Minimal automaton
释义	Minimal automaton 英语百科 DFA minimization In automata theory (a branch of computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states. Here, two DFAs are called equivalent if they recognize the same regular language. Several different algorithms accomplishing this task are known and described in standard textbooks on automata theory.
随便看	articular facet of costal tubercle的意思 Articular facet of head of fibula的意思 articular facet of lateral malleolus的意思 articular facet of medial malleolus的意思 Articular facet of patella的意思 Articular facets的意思 articular facets for rib cartilages的意思 articular facets of costal head的意思 articular facets of transverse process的意思 articular fossa的意思 articular fossa for odontoid process of axis的意思 articular fossa of atlas,inferior的意思 articular fossa of atlas,superior的意思 articular fossa of mandible的意思 articular fossa of temporal bone的意思 articular fovea的意思 articular foveae for rib cartilages的意思 articular fovea of temporal bone的意思 articular fracture的意思 Articular fungus的意思 articular genu的意思 articular genus的意思 articular glanders的意思 articular gout的意思 articular head的意思

Minimal automaton

DFA minimization