تقرير
On asymptotically automatic sequences
العنوان: | On asymptotically automatic sequences |
---|---|
المؤلفون: | Konieczny, Jakub |
سنة النشر: | 2023 |
المجموعة: | Computer Science Mathematics |
مصطلحات موضوعية: | Mathematics - Number Theory, Computer Science - Formal Languages and Automata Theory, Mathematics - Combinatorics |
الوصف: | 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. Comment: 32 pages; comments welcome |
نوع الوثيقة: | Working Paper |
URL الوصول: | http://arxiv.org/abs/2305.09885 |
رقم الأكسشن: | edsarx.2305.09885 |
قاعدة البيانات: | arXiv |
الوصف غير متاح. |