Strongly connected synchronizing automata and the language of minimal reset words

@article{Rodaro2017StronglyCS,
  title={Strongly connected synchronizing automata and the language of minimal reset words},
  author={Emanuele Rodaro},
  journal={Adv. Appl. Math.},
  year={2017},
  volume={99},
  pages={158-173}
}
Abstract We approach the problem of finding strongly connected synchronizing automata with a given ideal I that serves as the set of reset words, by studying the set of minimal words M of the ideal I (no proper factor is a reset word). We first show the existence of an infinite strongly connected synchronizing automaton A having I as the set of reset words and such that every other strongly connected synchronizing automaton having I as the set of reset words is an homomorphic image of A… CONTINUE READING
1
Twitter Mention