Remarks on separating words

Author(s)
Demaine, Erik D.; Eisenstat, Sarah Charmian; Shallit, Jeffrey; Wilson, David A.
Thumbnail
DownloadDemaine-Remarks on separating.pdf (231.8Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
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.
Description
Proceedings of the 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011.
Date issued
2011-07
URI
http://hdl.handle.net/1721.1/73455
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Descriptional Complexity of Formal Systems
Publisher
Springer Berlin/Heidelberg
Citation
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.
Version: Author's final manuscript
ISBN
978-3-642-22599-4
Collections