On the synchronization of small sets of states

@article{Montoya2017OnTS,
  title={On the synchronization of small sets of states},
  author={J. Andr{\'e}s Montoya and Christian Nolasco},
  journal={Applied mathematical sciences},
  year={2017},
  volume={11},
  pages={2151-2173}
}
We study some problems related to the synchronization of finite state automata and The Černy’s conjecture. We focus on the synchronization of small sets of states, and more specifically on the synchronization of triples. We argue that it is the most simple synchronization scenario that exhibits the same intricacies of the original Černy’s scenario (all states synchronization). Thus, we argue that it is complex enough to be interesting, and tractable enough to be studied via algorithmic tools… 

Figures from this paper

On the synchronization of finite state automata
TLDR
It is proved that recognizing the planar games that can be won by the synchronizer is a co-NP hard problem and some additional results indicating that pla- nar games are as hard as nonplanar games amount to show that planar automata are representative of the intricacies of automata synchronization.
On the synchronization of planar automata
TLDR
New (and old) evidence is provided concerning the conjectured Cerny-universality of planar automata, which is conjectured to be representative of the synchronizing behavior of deterministic finite state automata.
Automata specialities: Cerny automata
We study the following question: what does make Černý automata such a singular set of automata? We give some partial answers. Mathematics Subject Classification: 68R01

References

SHOWING 1-10 OF 28 REFERENCES
Synchronizing Automata with Extremal Properties
TLDR
This paper disproves a conjecture that every subset in a strongly connected synchronizing automaton is cn-extendable, for some constant c, and shows that the cubic upper bound on the length of the shortest reset words cannot be improved generally by means of the extension method.
On two Algorithmic Problems about Synchronizing Automata
TLDR
It is proved that two natural problems from the theory of synchronizing automata cannot be solved in polynomial time.
Generating Small Automata and the Černý Conjecture
TLDR
A new efficient algorithm is presented to generate all nonisomorphic automata with given numbers of states and input letters and this is used to verify the Cerný conjecture for all binary Automata with n≤11 states.
Subset Synchronization of Transitive Automata
TLDR
It is proved that the existence of a reset word for given automaton and subset is known to be a PSPACE-completeproblem, and it is shown that this holds even if the authors restrict it to transitive binary automata.
The #268;erný Conjecture and Other Synchronization Problems
TLDR
It is established that, in order to find an upper bound on the length of shortest universal synchronizing words for all totally synchronizing digraphs, it is enough to do so forDigraphs with a unique sink and totally synchronized strongly connected digraphS, and Cerný’s Conjecture for weakly oriented automata is proved, thus obtaining a generalization and a simplification of Eppstein’S solution for oriented automATA.
On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata
TLDR
A new upper bound on the triple rendezvous time is obtained by coupling two different novel approaches based on the synchronizing probability function and properties of linear programming and it is suggested that natural follow-ups toward the Cerný conjecture are suggested.
Reset Sequences for Monotonic Automata
TLDR
A new algorithm based on breadth-first search is presented that runs in faster asymptotic time than Natarajan’s algorithms, and in addition finds the shortest possible reset sequence if such a sequence exists.
Synchronizing Automata and the Cerny Conjecture
TLDR
Some recent advances towards a solution of the Cerný conjecture are discussed and several results and open problems related to synchronizing automata are surveyed.
Testing finite state machines
TLDR
It is shown that in randomized polynomial time, a checking sequence of length O(pn4 log n), i.e., a sequence that detects all faulty machines with at most n states, can be constructed with high probability.
Slowly Synchronizing Automata and Digraphs
TLDR
Several infinite series of synchronizing automata for which the minimum length of reset words is close to the square of the number of states are presented, related to primitive digraphs with large exponent.
...
1
2
3
...