Remarks on separating words

Computer Science – Formal Languages and Automata Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Remarks on separating words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Remarks on separating words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Remarks on separating words will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-441313

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.