Abstract
Pin showed that every p-state automaton ( p a prime) containing a cyclic permutation and a non-permutation has a synchronizing word of length at most ( p - 1 ) 2 . In this paper, we consider permutation automata with the property that adding any non-permutation will lead to a synchronizing word and establish bounds on the lengths of such synchronizing words. In particular, we show that permutation groups whose permutation character over the rationals splits into a sum of only two irreducible characters have the desired property.
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.
