Remarks on separating words
classification
💻 cs.FL
cs.DM
keywords
wordsproblemseparatingacceptingasksconsiderdistinguishknown
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.