Reference : Automatic sequences: from rational bases to trees
E-prints/Working papers : Already available on another site
Physical, chemical, mathematical & earth Sciences : Mathematics
http://hdl.handle.net/2268/257251
Automatic sequences: from rational bases to trees
English
Rigo, Michel mailto [Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes >]
Stipulanti, Manon mailto [Université de Liège - ULiège > Département de mathématique > Département de mathématique >]
Feb-2021
25
No
[en] Automatic sequences ; abstract numeration systems ; ational base numeration systems ; alternating morphisms ; PD0L systems ; Cobham’s theorem.
[en] The nth term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of n in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration system with a regular numeration language, we consider these built on languages associated with trees having periodic labeled signatures and, in particular, rational base numeration systems. We obtain two main characterizations of these sequences. The first one is concerned with r-block substitutions where r morphisms are applied periodically. In particular, we provide examples of such sequences that are not morphic. The second characterization involves the factors, or subtrees of finite height, of the tree associated with the numeration system and decorated by the terms of the sequence.
F.R.S.-FNRS - Fonds de la Recherche Scientifique
Researchers ; Professionals ; Students
http://hdl.handle.net/2268/257251
https://arxiv.org/abs/2102.10828

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
papier1.pdfAuthor preprint443.2 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.