On the Number of Restrictions Determining a Periodical Sequence
We consider sequences W of the period и over an alphabet consisting of l letters. It is required to determine unambiguously the sequence W picking out words which are not subwords of the sequence. For n G N we denote by Un the set of words и of length n, which are not powers (i.e. are not represente...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2007-06-01
|
| Series: | Моделирование и анализ информационных систем |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1118 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849401202168561664 |
|---|---|
| author | G. R. Chelnokov |
| author_facet | G. R. Chelnokov |
| author_sort | G. R. Chelnokov |
| collection | DOAJ |
| description | We consider sequences W of the period и over an alphabet consisting of l letters. It is required to determine unambiguously the sequence W picking out words which are not subwords of the sequence. For n G N we denote by Un the set of words и of length n, which are not powers (i.e. are not represented in form и = vk k > 1). |
| format | Article |
| id | doaj-art-28a3acdf00624f7ab9b8b2b0ff49b264 |
| institution | Kabale University |
| issn | 1818-1015 2313-5417 |
| language | English |
| publishDate | 2007-06-01 |
| publisher | Yaroslavl State University |
| record_format | Article |
| series | Моделирование и анализ информационных систем |
| spelling | doaj-art-28a3acdf00624f7ab9b8b2b0ff49b2642025-08-20T03:37:50ZengYaroslavl State UniversityМоделирование и анализ информационных систем1818-10152313-54172007-06-011421216859On the Number of Restrictions Determining a Periodical SequenceG. R. Chelnokov0Ярославский государственный университетWe consider sequences W of the period и over an alphabet consisting of l letters. It is required to determine unambiguously the sequence W picking out words which are not subwords of the sequence. For n G N we denote by Un the set of words и of length n, which are not powers (i.e. are not represented in form и = vk k > 1).https://www.mais-journal.ru/jour/article/view/1118 |
| spellingShingle | G. R. Chelnokov On the Number of Restrictions Determining a Periodical Sequence Моделирование и анализ информационных систем |
| title | On the Number of Restrictions Determining a Periodical Sequence |
| title_full | On the Number of Restrictions Determining a Periodical Sequence |
| title_fullStr | On the Number of Restrictions Determining a Periodical Sequence |
| title_full_unstemmed | On the Number of Restrictions Determining a Periodical Sequence |
| title_short | On the Number of Restrictions Determining a Periodical Sequence |
| title_sort | on the number of restrictions determining a periodical sequence |
| url | https://www.mais-journal.ru/jour/article/view/1118 |
| work_keys_str_mv | AT grchelnokov onthenumberofrestrictionsdeterminingaperiodicalsequence |