Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-03-23
Computer Science
Formal Languages and Automata Theory
Scientific paper
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.
Demaine Erik D.
Eisenstat Sarah
Shallit Jeffrey
Wilson David A.
No associations
LandOfFree
Remarks on separating words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Remarks on separating words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Remarks on separating words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-441313