Remarks on Separating Words

  • Erik D. Demaine
  • Sarah Eisenstat
  • Jeffrey Shallit
  • David A. Wilson
Conference paper

DOI: 10.1007/978-3-642-22600-7_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)
Cite this paper as:
Demaine E.D., Eisenstat S., Shallit J., Wilson D.A. (2011) Remarks on Separating Words. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Erik D. Demaine
    • 1
  • Sarah Eisenstat
    • 1
  • Jeffrey Shallit
    • 2
  • David A. Wilson
    • 1
  1. 1.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA
  2. 2.School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations