Abstract
An automaton is synchronizing if there exists a word driving it into a definite state regardless of the starting state. For an n-state automaton the set of synchronizing words is a regular language that can be accepted by an automaton having 2n−n states. Here, we study automata over two input letters and circular automata with n states having the property that the minimal automata for their sets of synchronizing words have 2n−n states, i.e., the minimal automata are maximal possible. We give a sufficient condition for this property that links it to completely reachable automata, non-trivial automaton congruences and the notion of uniform minimality. We apply our result to the family Kn of automata that was previously only conjectured to have this property.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.