Remarks on Separating Words

  title={Remarks on Separating Words},
  author={E. Demaine and Sarah Eisenstat and J. Shallit and D. Wilson},
  • E. Demaine, Sarah Eisenstat, +1 author D. Wilson
  • Published 2011
  • Computer Science, Mathematics
  • ArXiv
  • 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. 

    Topics from this paper.

    Paper Mentions

    A multi-parameter analysis of hard problems on deterministic finite automata
    • 16
    • PDF
    Can one quantum bit separate any pair of words with zero-error?
    • 11
    • PDF
    Semigroup identities of tropical matrices through matrix ranks
    • 6
    • PDF
    The distinguishability operation on regular languages
    • 4
    • PDF
    On a Conjecture by Christian Choffrut
    • 3
    Looking for Pairs that Hard to Separate: A Quantum Approach
    • 3
    • PDF
    On discerning strings with finite automata
    • 3
    On the Separating Words Problem
    • 1
    • PDF


    Publications referenced by this paper.
    Finite Automata and Unary Languages
    • 271
    • PDF
    A Second Course in Formal Languages and Automata Theory
    • 191
    • PDF
    Automaticity I: Properties of a Measure of Descriptional Complexity
    • 65
    Separating Strings with Small Automata
    • 24
    Separating Words with Machines and Groups
    • 14
    • PDF
    Separating Words with Small Grammars
    • 7
    On Discerning Words by Automata
    • 18
    • Highly Influential
    Magic Numbers in the State Hierarchy of Finite Automata
    • 19
    Identical Relations in Symmetric Groups and Separating Words with Reversible Automata
    • 8
    Equivalence Problem of Non-Deterministic Finite Automata
    • 4