DFA minimization
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.
Aperiodic finite state automatonAutomata theoryAutomaton minimizationBüchi automatonDeterministic acyclic finite state automatonDeterministic finite automatonDfa minimizationFinite-state machineFinite state machine minimizationGlushkov's construction algorithmJanusz Brzozowski (computer scientist)List of algorithmsList of terms relating to algorithms and data structuresMcNaughton's theoremMinimal DFAMinimal automatonMinimal deterministic finite state machineMinimized dfaMinimizing deterministic finite automatonMyhill–Nerode theoremNFA minimizationPartition refinementPowerset constructionRe2cRegular expressionRegular languageSemiautomatonState encoding for low powerSuffix automatonSyntactic monoidThompson's constructionTransformation semigroup
Link from a Wikipage to another Wikipage
primaryTopic
DFA minimization
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.
has abstract
Em ciência da computação, mais ...... bordam a teoria dos autômatos.
@pt
En informatique théorique, et ...... s de manipulation d'automates.
@fr
In Teoria degli automi (branca ...... diversi metodi e complessità.
@it
In automata theory (a branch o ...... textbooks on automata theory.
@en
В інформатиці, чи якщо точніше ...... підручниках теорії автоматів.
@uk
Минимизация ДКА — построение п ...... шее возможное число состояний.
@ru
في نظرية احركه (فرع علوم الكمب ...... من البحث عن القوة الغير واضحه.
@ar
在自动机理论（计算机科学的一个分支）中，确定有限状态自动机最 ...... 语言。各自动机理论的教材中，已经给出了若干已知的最小化算法。
@zh
Link from a Wikipage to an external page
Wikipage page ID
17,447,039
page length (characters) of wiki page
Wikipage revision ID
1,022,177,339
Link from a Wikipage to another Wikipage
authorlink
Edward F. Moore
@en
first
Edward F.
@en
last
Moore
@en
wikiPageUsesTemplate
hypernym
type
comment
Em ciência da computação, mais ...... bordam a teoria dos autômatos.
@pt
En informatique théorique, et ...... tant de théorie des automates.
@fr
In Teoria degli automi (branca ...... diversi metodi e complessità.
@it
In automata theory (a branch o ...... textbooks on automata theory.
@en
В інформатиці, чи якщо точніше ...... підручниках теорії автоматів.
@uk
Минимизация ДКА — построение п ...... шее возможное число состояний.
@ru
في نظرية احركه (فرع علوم الكمب ...... بية للمهام مثل مطابقة الأنماط.
@ar
在自动机理论（计算机科学的一个分支）中，确定有限状态自动机最 ...... 语言。各自动机理论的教材中，已经给出了若干已知的最小化算法。
@zh
label
DFA minimization
@en
Minimisation d'un automate fini déterministe
@fr
Minimização de AFD
@pt
Minimizzazione di DFA
@it
Минимизация ДКА
@ru
Мінімізація ДСкА
@uk
تصغير DFA
@ar
确定有限状态自动机最小化
@zh