Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Separating_words_problem> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Separating_words_problem abstract "In theoretical computer science, the separating words problem is the problem of finding the smallest deterministic finite automaton that behaves differently on two given strings, meaning that it accepts one of the two strings and rejects the other string. It is an open problem how large such an automaton must be, in the worst case, as a function of the length of the input strings.".
- Separating_words_problem wikiPageID "48936369".
- Separating_words_problem wikiPageLength "6485".
- Separating_words_problem wikiPageOutDegree "16".
- Separating_words_problem wikiPageRevisionID "697209981".
- Separating_words_problem wikiPageWikiLink Almost_all.
- Separating_words_problem wikiPageWikiLink Category:Finite_automata.
- Separating_words_problem wikiPageWikiLink Category:Problems_on_strings.
- Separating_words_problem wikiPageWikiLink Deterministic_finite_automaton.
- Separating_words_problem wikiPageWikiLink Hamming_distance.
- Separating_words_problem wikiPageWikiLink Hamming_weight.
- Separating_words_problem wikiPageWikiLink Jeffrey_Shallit.
- Separating_words_problem wikiPageWikiLink Modular_arithmetic.
- Separating_words_problem wikiPageWikiLink Open_problem.
- Separating_words_problem wikiPageWikiLink Parity_(mathematics).
- Separating_words_problem wikiPageWikiLink Prime_number.
- Separating_words_problem wikiPageWikiLink String_(computer_science).
- Separating_words_problem wikiPageWikiLink String_operations.
- Separating_words_problem wikiPageWikiLink Theoretical_computer_science.
- Separating_words_problem wikiPageWikiLinkText "Separating words problem".
- Separating_words_problem wikiPageUsesTemplate Template:Harvtxt.
- Separating_words_problem wikiPageUsesTemplate Template:Math.
- Separating_words_problem wikiPageUsesTemplate Template:Mvar.
- Separating_words_problem wikiPageUsesTemplate Template:Reflist.
- Separating_words_problem wikiPageUsesTemplate Template:Unsolved.
- Separating_words_problem subject Category:Finite_automata.
- Separating_words_problem subject Category:Problems_on_strings.
- Separating_words_problem hypernym Problem.
- Separating_words_problem type Disease.
- Separating_words_problem comment "In theoretical computer science, the separating words problem is the problem of finding the smallest deterministic finite automaton that behaves differently on two given strings, meaning that it accepts one of the two strings and rejects the other string. It is an open problem how large such an automaton must be, in the worst case, as a function of the length of the input strings.".
- Separating_words_problem label "Separating words problem".
- Separating_words_problem wasDerivedFrom Separating_words_problem?oldid=697209981.
- Separating_words_problem isPrimaryTopicOf Separating_words_problem.