Skip to Main content Skip to Navigation
Conference papers

Automata for arithmetic Meyer sets

Abstract : The set ℤβ of β-integers is a Meyer set when β is a Pisot number, and thus there exists a finite set F such that ℤβ-ℤβ⊂ℤβ+F. We give finite automata describing the expansions of the elements of ℤβ and of ℤβ-ℤβ. We present a construction of such a finite set F, and a method to minimize the size of F. We obtain in this way a finite transducer that performs the decomposition of the elements of ℤβ-ℤβ as a sum belonging to ℤβ+F.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Christiane Frougny Connect in order to contact the contributor
Submitted on : Tuesday, May 28, 2013 - 2:35:17 PM
Last modification on : Wednesday, January 19, 2022 - 4:42:04 PM
Long-term archiving on: : Thursday, August 29, 2013 - 2:25:08 AM


Files produced by the author(s)



Shigeki Akiyama, Frédérique Bassino, Christiane Frougny. Automata for arithmetic Meyer sets. LATIN 04, 2004, Buenos-Aires, Argentina. pp.252-261, ⟨10.1007/978-3-540-24698-5_29⟩. ⟨hal-00159713⟩



Record views


Files downloads