Abstract
Numeration systems where the basis is defined by a linear recurrence with integer coefficients are considered. A rewriting system is associated with the recurrence. In this paper we study the case when it is confluent. We prove that the function of normalization which transforms any representation of an integer into the normal one — obtained by the usual algorithm — can be realized by a finite automation which is the composition of a left subsequential transducer and of a right subsequential transducer associated with the rewriting system. Addition of integers in a confluent linear numeration system is also computable by a finite automaton. These results extend to the representation of real numbers in basis θ, where θ is the dominant root of the characteristic polynomial of the recurrence.
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.
