Abstract
We show that if the state set Q of a synchronizing automaton A = admits a linear order such that for each letter a ∈ Σ the transformation δ(―, a) of Q preserves this order, then A possesses a reset word of length |Q|-1. We also consider two natural generalizations of the notion of a reset word and provide for them results of a similar flavour.
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 callSimilar Papers
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.
