Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5204896> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Q5204896 subject Q8269001.
- Q5204896 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.".
- Q5204896 thumbnail DFA_to_be_minimized.jpg?width=300.
- Q5204896 wikiPageExternalLink CS-TR-71-190.pdf.
- Q5204896 wikiPageExternalLink 1.pdf.
- Q5204896 wikiPageExternalLink pdf?md5=00582bb1bdc5f7a3af33b8c19479d3d3&pid=1-s2.0-0304397585902154-main.pdf.
- Q5204896 wikiPageExternalLink pdf?md5=ae550d58084acf5f9af3fac6b8b20106&pid=1-s2.0-S0304397581800059-main.pdf.
- Q5204896 wikiPageWikiLink Q1211071.
- Q5204896 wikiPageWikiLink Q186094.
- Q5204896 wikiPageWikiLink Q189224.
- Q5204896 wikiPageWikiLink Q205084.
- Q5204896 wikiPageWikiLink Q2106494.
- Q5204896 wikiPageWikiLink Q21198.
- Q5204896 wikiPageWikiLink Q214526.
- Q5204896 wikiPageWikiLink Q381060.
- Q5204896 wikiPageWikiLink Q422187.
- Q5204896 wikiPageWikiLink Q4828244.
- Q5204896 wikiPageWikiLink Q500716.
- Q5204896 wikiPageWikiLink Q617295.
- Q5204896 wikiPageWikiLink Q7140650.
- Q5204896 wikiPageWikiLink Q7486248.
- Q5204896 wikiPageWikiLink Q752532.
- Q5204896 wikiPageWikiLink Q7782354.
- Q5204896 wikiPageWikiLink Q8269001.
- Q5204896 wikiPageWikiLink Q830223.
- Q5204896 wikiPageWikiLink Q837528.
- Q5204896 wikiPageWikiLink Q846354.
- Q5204896 wikiPageWikiLink Q849775.
- Q5204896 wikiPageWikiLink Q912887.
- Q5204896 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.".
- Q5204896 label "DFA minimization".
- Q5204896 depiction DFA_to_be_minimized.jpg.