Synchronizing automata preserving a chain of partial orders

@article{Volkov2009SynchronizingAP,
  title={Synchronizing automata preserving a chain of partial orders},
  author={Mikhail V. Volkov},
  journal={Theor. Comput. Sci.},
  year={2009},
  volume={410},
  pages={3513-3519}
}
We present a new class of automata which strictly contains the class of aperiodic automata and shares with the latter certain synchronization properties. In particular, every strongly connected automaton in this new class is synchronizing and has a synchronizing word of length @?n(n+1)6@? where n is the number of states of the automaton. 

Topics from this paper.

Similar Papers