Paper by Erik D. Demaine
- Erik D. Demaine, Sarah Eisenstat, Jeffrey Shallit, and David A. Wilson, “Remarks on Separating Words”, in Proceedings of the 13th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2011), Lecture Notes in Computer Science, volume 6808, Giessen, Germany, July 25–27, 2011, pages 147–157.
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 is also available as arXiv:1103.4513 of the Computing Research Repository (CoRR). and from SpringerLink.
- The paper is 12 pages.
- The paper is available in PostScript (359k), gzipped PostScript (156k), and PDF (231k).
- See information on file formats.
- [Google Scholar search]
See also other papers by Erik Demaine.
These pages are generated automagically from a
Last updated September 3, 2017 by