Slowly synchronizing automata and digraphs

Details Slowly synchronizing automata and digraphs Slowly synchronizing automata and digraphs

2010-05-02

arxiv.org/abs/1005.0129v1

Computer Science

Formal Languages and Automata Theory

13 pages, 5 figures

Scientific paper

We present several infinite series of synchronizing automata for which the
minimum length of reset words is close to the square of the number of states.
These automata are closely related to primitive digraphs with large exponent.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-723860