Abstract
The largest known reset thresholds for DFAs are equal to [Formula: see text], where [Formula: see text] is the number of states. This is conjectured to be the maximum possible. PFAs (with partial transition function) can have exponentially large reset thresholds. This is still true if we restrict to binary PFAs. However, asymptotics do not give conclusions for fixed [Formula: see text]. We prove that the maximal reset threshold for binary PFAs is strictly greater than [Formula: see text] if and only if [Formula: see text]. These results are mostly based on the analysis of synchronizing word lengths for a certain family of binary PFAs. This family has the following properties: it contains the well-known Černý automata; for [Formula: see text] it contains a binary PFA with maximal possible reset threshold; for all [Formula: see text] it contains a PFA with reset threshold larger than the maximum known for DFAs. Analysis of this family reveals remarkable patterns involving the Fibonacci numbers and related sequences such as the Padovan sequence. We derive explicit formulas for the reset thresholds in terms of these recurrent sequences. Asymptotically the Černý family gives reset thresholds of polynomial order. We prove that PFAs in the family are not extremal for [Formula: see text]. For that purpose, we present an improvement of Martyugin’s prime number construction of binary PFAs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Foundations of Computer Science
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.