DFA minimization
Task of transforming a deterministic finite automaton
In automata theory (a branch of theoretical 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.
Nº Q5204896 ★
Common · History
DFA minimization
Task of transforming a deterministic finite automaton
In automata theory (a branch of theoretical 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.
From Wikipedia
In automata theory (a branch of theoretical 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.
Text: Wikipédia, CC BY-SA 4.0. · Image: Pat Hawks (CC BY 4.0) ·
Related cards
-
P
Powerset construction
Method for converting a nondeterministic finite automaton into a deterministic one
Nº Q2106494 ★
Not listed
-
M
Minimax
Decision rule used for minimizing the possible loss for a worst case scenario
Nº Q751319 ★★★
Not listed
-
M
Myhill–Nerode theorem
Theorem
Nº Q422187 ★★★
Not listed
-
Law of Demeter
Guideline for object-oriented programming: each unit should have only limited knowledge about other units (only those closely related to the current unit)
Nº Q499585 ★
Not listed
-
K
Kleene's theorem
Theorem
Nº Q955054 ★
Not listed
-
E
Empirical risk minimization
In computer science, a way to determine theoretical bounds in machine learning
Nº Q5374254 ★
Not listed