Synchronizing Automata with Extremal Properties

@inproceedings{Kisielewicz2015SynchronizingAW,
  title={Synchronizing Automata with Extremal Properties},
  author={Andrzej Kisielewicz and Marek Szykula},
  booktitle={MFCS},
  year={2015}
}
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length Θ(n 2), where n is the number of states of the automaton. This disproves a conjecture that every subset in a strongly connected synchronizing automaton is cn-extendable, for some constant c, and in particular, shows that the cubic upper bound on the length of the shortest reset words… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…