تقرير
Arithmetical subword complexity of automatic sequences
| العنوان: | Arithmetical subword complexity of automatic sequences |
|---|---|
| المؤلفون: | Konieczny, Jakub, Müllner, Clemens |
| سنة النشر: | 2023 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Mathematics - Number Theory, Computer Science - Formal Languages and Automata Theory, Mathematics - Combinatorics |
| الوصف: | We fully classify automatic sequences $a$ over a finite alphabet $\Omega$ with the property that each word over $\Omega$ appears is $a$ along an arithmetic progression. Using the terminology introduced by Avgustinovich, Fon-Der-Flaass and Frid, these are the automatic sequences with the maximal possible arithmetical subword complexity. More generally, we obtain an asymptotic formula for arithmetical (and even polynomial) subword complexity of a given automatic sequence $a$. Comment: 14 pages, comments welcome |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2309.03180 |
| رقم الأكسشن: | edsarx.2309.03180 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |