Approximating the minimum length of synchronizing words is hard

Details Approximating the minimum length of synchronizing words is hard Approximating the minimum length of synchronizing words is hard

2009-09-21

arxiv.org/abs/0909.3787v2

Computer Science

Formal Languages and Automata Theory

12 pages, 1 figure

Scientific paper

We prove that, unless $\mathrm{P}=\mathrm{NP}$, no polynomial algorithm can
approximate the minimum length of \sws for a given \san within a constant
factor.

Affiliated with

Also associated with

No associations

Rating

Approximating the minimum length of synchronizing words is hard 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 Approximating the minimum length of synchronizing words is hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating the minimum length of synchronizing words is hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432946