Abstract
AbstractLet θ, θ′ be two multiplicatively independent Pisot numbers, and letU,U′ be two linear numeration systems whose characteristic polynomial is the minimal polynomial of θ and θ′, respectively. For everyn≥ 1, ifA⊆ ℕnisU-andU′ -recognizable thenAis definable in 〈ℕ: + 〉.
Publisher
Cambridge University Press (CUP)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Strong Version of Cobham’s Theorem;SIAM Journal on Computing;2024-01-17
2. An asymptotic version of Cobham’s theorem;Acta Arithmetica;2023
3. A density version of Cobham’s theorem;Acta Arithmetica;2020
4. Bibliography;Formal Languages, Automata and Numeration Systems 2;2014-09-12
5. Bibliography;Formal Languages, Automata and Numeration Systems 1;2014-09-12