Matches in DBpedia 2014 for { <http://dbpedia.org/resource/DFA_minimization> ?p ?o. }
Showing items 1 to 20 of
20
with 100 items per page.
- DFA_minimization abstract "In computer science, more specifically in the branch of automata theory, DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has 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.".
- DFA_minimization wikiPageExternalLink 1.pdf.
- DFA_minimization wikiPageID "17447039".
- DFA_minimization wikiPageRevisionID "579680815".
- DFA_minimization authorlink "Edward F. Moore".
- DFA_minimization first "Edward F.".
- DFA_minimization hasPhotoCollection DFA_minimization.
- DFA_minimization last "Moore".
- DFA_minimization year "1956".
- DFA_minimization subject Category:Articles_with_example_pseudocode.
- DFA_minimization subject Category:Automata_theory.
- DFA_minimization comment "In computer science, more specifically in the branch of automata theory, DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has 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.".
- DFA_minimization label "DFA minimization".
- DFA_minimization label "Minimização de AFD".
- DFA_minimization sameAs Minimização_de_AFD.
- DFA_minimization sameAs m.047qk9v.
- DFA_minimization sameAs Q5204896.
- DFA_minimization sameAs Q5204896.
- DFA_minimization wasDerivedFrom DFA_minimization?oldid=579680815.
- DFA_minimization isPrimaryTopicOf DFA_minimization.