Remarks on separating words
Author(s)Demaine, Erik D.; Eisenstat, Sarah Charmian; Shallit, Jeffrey; Wilson, David A.
MetadataShow full item record
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.
Proceedings of the 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Descriptional Complexity of Formal Systems
Demaine, Erik D. et al. “Remarks on Separating Words.” Descriptional Complexity of Formal Systems. Ed. Markus Holzer, Martin Kutrib, & Giovanni Pighizzini. LNCS Vol. 6808. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 147-157.
Author's final manuscript