Remarks on Separating Words

@inproceedings{Demaine2011RemarksOS,
  title={Remarks on Separating Words},
  author={E. Demaine and Sarah Eisenstat and J. Shallit and D. Wilson},
  booktitle={DCFS},
  year={2011}
}
  • E. Demaine, Sarah Eisenstat, +1 author D. Wilson
  • Published in DCFS 2011
  • Mathematics, Computer Science
  • 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. 
    17 Citations

    Topics from this paper.

    Paper Mentions

    On the Separating Words Problem
    • 1
    • PDF
    On a Conjecture by Christian Choffrut
    • 3
    The distinguishability operation on regular languages
    • 4
    • PDF
    Looking for Pairs that Hard to Separate: A Quantum Approach
    • 3
    • PDF
    On the gap between separating words and separating their reversals
    On discerning strings with finite automata
    • 3
    A multi-parameter analysis of hard problems on deterministic finite automata
    • 17
    • PDF

    References

    SHOWING 1-10 OF 13 REFERENCES
    Separating Words with Machines and Groups
    • J. Robson
    • Mathematics, Computer Science
    • RAIRO Theor. Informatics Appl.
    • 1996
    • 14
    • PDF
    Separating Words with Small Grammars
    • 7
    Separating Strings with Small Automata
    • J. Robson
    • Mathematics, Computer Science
    • Inf. Process. Lett.
    • 1989
    • 24
    Identical Relations in Symmetric Groups and Separating Words with Reversible Automata
    • 8
    Finite Automata and Unary Languages
    • M. Chrobak
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 1986
    • 274
    • PDF
    Equivalence Problem of Non-Deterministic Finite Automata
    • A. Nozaki
    • Mathematics, Computer Science
    • J. Comput. Syst. Sci.
    • 1979
    • 4
    Automaticity I: Properties of a Measure of Descriptional Complexity
    • 65
    On Discerning Words by Automata
    • 18
    • Highly Influential
    Magic Numbers in the State Hierarchy of Finite Automata
    • 19
    A Second Course in Formal Languages and Automata Theory
    • 193
    • PDF