http://wiki.karljones.com/index.php?action=history&feed=atom&title=Separating_words_problem 2026-10-23T16:28:45Z Revision history for this page on the wiki MediaWiki 1.24.2 http://wiki.karljones.com/index.php?title=Separating_words_problem&diff=17324&oldid=prev 2016-08-26T22:33:03Z

<p>Created page with &quot;In <a href="/index.php/Theoretical_computer_science" title="Theoretical computer science">theoretical computer science</a>, the &#039;&#039;&#039;separating words problem&#039;&#039;&#039; is the problem of finding the smallest <a href="/index.php/Deterministic_finite_automaton" title="Deterministic finite automaton">deterministic finite automaton</a> that behaves differently on t...&quot;</p> <p><b>New page</b></p><div>In [[theoretical computer science]], the '''separating words problem''' is the problem of finding the smallest [[deterministic finite automaton]] that behaves differently on two given [[String (computer science)|strings]], meaning that it accepts one of the two strings and rejects the other string.<br /> <br /> 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.<br /> <br /> == See also ==<br /> <br /> * [[Deterministic finite automaton]]<br /> * [[String (computer science)]]<br /> <br /> == External links ==<br /> <br /> * [https://en.wikipedia.org/wiki/Separating_words_problem Separating words problem] @ Wikipedia<br /> <br /> [[Category:Computer science]]<br /> [[Category:Computing]]</div>

Karl Jones