arXiv · 2305.09885
On asymptotically automatic sequences
Abstract
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.
Explore related subjects
Keep this discovery
Jakub Konieczny. 2023-05-17. On asymptotically automatic sequences. https://arxiv.org/abs/2305.09885
Cite the original work for its findings. Save a collection to share your selection of sources.