Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/DFA_minimization> ?p ?o }
Showing triples 1 to 76 of
76
with 100 triples per page.
- DFA_minimization abstract "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.".
- DFA_minimization thumbnail DFA_to_be_minimized.jpg?width=300.
- DFA_minimization wikiPageExternalLink CS-TR-71-190.pdf.
- DFA_minimization wikiPageExternalLink 1.pdf.
- DFA_minimization wikiPageExternalLink pdf?md5=00582bb1bdc5f7a3af33b8c19479d3d3&pid=1-s2.0-0304397585902154-main.pdf.
- DFA_minimization wikiPageExternalLink pdf?md5=ae550d58084acf5f9af3fac6b8b20106&pid=1-s2.0-S0304397581800059-main.pdf.
- DFA_minimization wikiPageID "17447039".
- DFA_minimization wikiPageLength "17409".
- DFA_minimization wikiPageOutDegree "28".
- DFA_minimization wikiPageRevisionID "686980198".
- DFA_minimization wikiPageWikiLink Automata_theory.
- DFA_minimization wikiPageWikiLink Average-case_complexity.
- DFA_minimization wikiPageWikiLink Best,_worst_and_average_case.
- DFA_minimization wikiPageWikiLink Cambridge_University_Press.
- DFA_minimization wikiPageWikiLink Category:Articles_with_example_pseudocode.
- DFA_minimization wikiPageWikiLink Category:Finite_automata.
- DFA_minimization wikiPageWikiLink Computational_complexity_theory.
- DFA_minimization wikiPageWikiLink Computer_science.
- DFA_minimization wikiPageWikiLink Deterministic_finite_automaton.
- DFA_minimization wikiPageWikiLink Equivalence_class.
- DFA_minimization wikiPageWikiLink Introduction_to_Automata_Theory,_Languages,_and_Computation.
- DFA_minimization wikiPageWikiLink Kleene_star.
- DFA_minimization wikiPageWikiLink Myhill–Nerode_theorem.
- DFA_minimization wikiPageWikiLink Nondeterministic_finite_automaton.
- DFA_minimization wikiPageWikiLink PSPACE.
- DFA_minimization wikiPageWikiLink P_(complexity).
- DFA_minimization wikiPageWikiLink Partition_of_a_set.
- DFA_minimization wikiPageWikiLink Partition_refinement.
- DFA_minimization wikiPageWikiLink Powerset_construction.
- DFA_minimization wikiPageWikiLink Pseudocode.
- DFA_minimization wikiPageWikiLink Radix_sort.
- DFA_minimization wikiPageWikiLink Regular_language.
- DFA_minimization wikiPageWikiLink State_encoding_for_low_power.
- DFA_minimization wikiPageWikiLink Theoretical_Computer_Science_(journal).
- DFA_minimization wikiPageWikiLink File:DFA_to_be_minimized.jpg.
- DFA_minimization wikiPageWikiLink File:Minimized_DFA.jpg.
- DFA_minimization wikiPageWikiLinkText "DFA minimization".
- DFA_minimization wikiPageWikiLinkText "DFA minimization#Minimum DFA".
- DFA_minimization wikiPageWikiLinkText "Hopcroft minimization algorithm".
- DFA_minimization wikiPageWikiLinkText "Minimization".
- DFA_minimization wikiPageWikiLinkText "equivalent states".
- DFA_minimization wikiPageWikiLinkText "minimal DFA".
- DFA_minimization wikiPageWikiLinkText "minimal deterministic finite automaton".
- DFA_minimization wikiPageWikiLinkText "minimal".
- DFA_minimization wikiPageWikiLinkText "minimized".
- DFA_minimization authorlink "Edward F. Moore".
- DFA_minimization first "Edward F.".
- DFA_minimization last "Moore".
- DFA_minimization wikiPageUsesTemplate Template:Citation.
- DFA_minimization wikiPageUsesTemplate Template:Cite_report.
- DFA_minimization wikiPageUsesTemplate Template:Cn.
- DFA_minimization wikiPageUsesTemplate Template:Harvs.
- DFA_minimization wikiPageUsesTemplate Template:Harvtxt.
- DFA_minimization wikiPageUsesTemplate Template:Main.
- DFA_minimization wikiPageUsesTemplate Template:Math.
- DFA_minimization wikiPageUsesTemplate Template:Mvar.
- DFA_minimization wikiPageUsesTemplate Template:Reflist.
- DFA_minimization wikiPageUsesTemplate Template:Sfnp.
- DFA_minimization year "1956".
- DFA_minimization subject Category:Articles_with_example_pseudocode.
- DFA_minimization subject Category:Finite_automata.
- DFA_minimization hypernym Task.
- DFA_minimization type Agent.
- DFA_minimization type Redirect.
- DFA_minimization comment "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.".
- DFA_minimization label "DFA minimization".
- DFA_minimization sameAs Q5204896.
- DFA_minimization sameAs مینیمسازی_دیافای.
- DFA_minimization sameAs Minimisation_dun_automate_fini_dxc3xa9terministe.
- DFA_minimization sameAs Minimização_de_AFD.
- DFA_minimization sameAs m.047qk9v.
- DFA_minimization sameAs Мінімізація_ДСкА.
- DFA_minimization sameAs Q5204896.
- DFA_minimization wasDerivedFrom DFA_minimization?oldid=686980198.
- DFA_minimization depiction DFA_to_be_minimized.jpg.
- DFA_minimization isPrimaryTopicOf DFA_minimization.