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 ★
Común · Historia
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.
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.
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.
Texto: Wikipedia en inglés, CC BY-SA 4.0. · Imagen: Pat Hawks (CC BY 4.0) ·
Cartas cercanas
-
C
Construcción de conjunto potencia
Nº Q2106494 ★
Sin ofertas
-
M
Minimax
Método de decisión en teoría de juegos
Nº Q751319 ★★★
Sin ofertas
-
T
Teorema de Myhill-Nerode
Nº Q422187 ★★★
Sin ofertas
-
Ley de Demeter
Nº Q499585 ★
Sin ofertas
-
K
Kleene's theorem
Theorem
Nº Q955054 ★
Sin ofertas
-
E
Empirical risk minimization
In computer science, a way to determine theoretical bounds in machine learning
Nº Q5374254 ★
Sin ofertas