Remarks on separating words
Name
Demaine-Remarks on separating.pdf
Size
231.86 KB
Format
Adobe PDF
Checksum (MD5)
53d94e9080c7d54532247376fd15a0ba
Author(s)
Demaine, Erik D.
Eisenstat, Sarah Charmian
Shallit, Jeffrey
Wilson, David A.
Date Issued
July 2011
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
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-22600-7_12
