Slowly synchronizing automata with zero and incomplete sets

Details Slowly synchronizing automata with zero and incomplete sets Slowly synchronizing automata with zero and incomplete sets

2009-07-27

arxiv.org/abs/0907.4576v1

Computer Science

Formal Languages and Automata Theory

9 pages, 6 figures

Scientific paper

Using combinatorial properties of incomplete sets in a free monoid we
construct a series of n-state deterministic automata with zero whose shortest
synchronizing word has length n^2/4+n/2-1.

Affiliated with

Also associated with

No associations

Rating

Slowly synchronizing automata with zero and incomplete sets 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 Slowly synchronizing automata with zero and incomplete sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Slowly synchronizing automata with zero and incomplete sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-245757