Remarks on separating words
2011
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.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
10
References
8
Citations
NaN
KQI