The Cerny conjecture for one-cluster automata with prime length cycle

Details The Cerny conjecture for one-cluster automata with prime length cycle The Cerny conjecture for one-cluster automata with prime length cycle

2010-05-11

arxiv.org/abs/1005.1835v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

We prove the Cerny conjecture for one-cluster automata with prime length
cycle. Consequences are given for the hybrid Road-coloring-Cerny conjecture for
digraphs with a proper cycle of prime length.

Affiliated with

Also associated with

No associations

Rating

The Cerny conjecture for one-cluster automata with prime length cycle 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 The Cerny conjecture for one-cluster automata with prime length cycle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Cerny conjecture for one-cluster automata with prime length cycle will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-384704