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.

This page was built for publication: On asymptotically automatic sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6510144)