Remarks on Separating Words
The separating words problem asks for the size of the smallest DFA needed to distinguish between two words of length ≤ n (by accepting one and rejecting the other). In this paper we survey what is known and unknown about the problem, consider some variations, and prove several new results.
KeywordsIdentical Relation Prime Number Theorem Input Tape Distinct Word Binary Word
Unable to display preview. Download preview PDF.