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. Finally, we show that for any non-unary regular ideal I there is a strongly connected synchronizing automaton having I as the set of reset words with at most (kmk)2kmkn states, where k is the dimension of the alphabet, m is twice the length of a shortest word in I, and n is the number of states of the smallest automaton recognizing M. This synchronizing automaton is computable and we exhibit an algorithm to compute it in time O((k2mk)2kmkn).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
