Independent sets of words and the synchronization problem

Details Independent sets of words and the synchronization problem Independent sets of words and the synchronization problem

2011-11-23

arxiv.org/abs/1111.5467v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

The synchronization problem is investigated for the class of locally strongly
transitive automata introduced in a previous work of the authors. Some
extensions of this problem related to the notions of stable set and word of
minimal rank of an automaton are studied. An application to synchronizing
colorings of aperiodic graphs with a Hamiltonian path is also considered.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-377090