On asymptotically automatic sequences
Acta Arithmetica, Tome 215 (2024) no. 3, pp. 249-287
Cet article a éte moissonné depuis la source Institute of Mathematics Polish Academy of Sciences
We study the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence. While $k$-automatic sequences are characterised by finiteness of $k$-kernels, the $k$-kernels of asymptotically $k$-automatic sequences are only required to be finite up to equality almost everywhere. We prove basic closure properties and a linear bound on asymptotic subword complexity, show that results concerning frequencies of symbols are no longer true for the asymptotic analogue, and discuss some classification problems. Published in Open Access (under CC-BY license).
Keywords:
study notion asymptotically automatic sequence which generalises notion automatic sequence while k automatic sequences characterised finiteness k kernels k kernels asymptotically k automatic sequences only required finite equality almost everywhere prove basic closure properties linear bound asymptotic subword complexity results concerning frequencies symbols longer asymptotic analogue discuss classification problems
Affiliations des auteurs :
Jakub Konieczny  1
@article{10_4064_aa230619_26_4,
author = {Jakub Konieczny},
title = {On asymptotically automatic sequences},
journal = {Acta Arithmetica},
pages = {249--287},
year = {2024},
volume = {215},
number = {3},
doi = {10.4064/aa230619-26-4},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/aa230619-26-4/}
}
Jakub Konieczny. On asymptotically automatic sequences. Acta Arithmetica, Tome 215 (2024) no. 3, pp. 249-287. doi: 10.4064/aa230619-26-4
Cité par Sources :