2020
DOI: 10.48550/arxiv.2007.08147
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Ultimate periodicity problem for linear numeration systems

Abstract: We address the following decision problem. Given a numeration system U and a U -recognizable set X ⊆ N, i.e. the set of its greedy U -representations is recognized by a finite automaton, decide whether or not X is ultimately periodic. We prove that this problem is decidable for a large class of numeration systems built on linearly recurrent sequences. Based on arithmetical considerations about the recurrence equation and on p-adic methods, the DFA given as input provides a bound on the admissible periods to te… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 15 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?