Rapport de Recherche Litp /
Litp research reports
22 pages - Novembre/November 1995 - Document en anglais.
PostScript : Ko /Kb
Titre / Title: Bertrand Numeration Systems and Recognizability
Abstract : There exist various well-known characterizations of sets of numbers recognizable by a finite automaton, when they are represented in some integer base p „ 2. We show how to modify these characterizations, when integer bases p are replaced by linear numeration systems whose characteristic polynomial is the minimal polynomial of a Pisot number. We also prove some related interesting properties.
Publications internes Litp 1995 / Litp research reports 1995