Abstract
There are several characterizations of sets of integers recognizable by automata, when they are written in p-ary representations, p≥2. We prove that most of them can be adapted to sets of integers written in nonstandard numeration systems, like Fibonacci numeration system.
Cite
CITATION STYLE
APA
Bruyère, V., & Hansel, G. (1995). Recognizable sets of numbers in nonstandard bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 911, pp. 167–179). Springer Verlag. https://doi.org/10.1007/3-540-59175-3_87
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free