Skip to main content
Article thumbnail
Location of Repository

Remarks on separating words

By Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit and David A. Wilson


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

Topics: Computer Science - Formal Languages and Automata Theory, Computer Science - Discrete Mathematics
Year: 2011
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.