Abstract
It is well known that the set of all natural numbers divisible by a fixed modulus m can be recognized by a finite state machine, assuming that the numbers are written in standard base-B representation. It is much harder to determine the state complexity of the minimal recognizer [1]. In this article we discuss the size of minimal recognizers for a variety of numeration systems, including reverse base-B representation and the Fibonacci system.
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.
