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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2007-06-01
|
| Series: | Modelirovanie i Analiz Informacionnyh Sistem |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1118 |
| id |
doaj-28a3acdf00624f7ab9b8b2b0ff49b264 |
|---|---|
| record_format |
Article |
| spelling |
doaj-28a3acdf00624f7ab9b8b2b0ff49b2642021-07-29T08:15:16ZengYaroslavl State UniversityModelirovanie i Analiz Informacionnyh Sistem1818-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 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
G. R. Chelnokov |
| spellingShingle |
G. R. Chelnokov On the Number of Restrictions Determining a Periodical Sequence Modelirovanie i Analiz Informacionnyh Sistem |
| author_facet |
G. R. Chelnokov |
| author_sort |
G. R. Chelnokov |
| title |
On the Number of Restrictions Determining a Periodical Sequence |
| title_short |
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_sort |
on the number of restrictions determining a periodical sequence |
| publisher |
Yaroslavl State University |
| series |
Modelirovanie i Analiz Informacionnyh Sistem |
| issn |
1818-1015 2313-5417 |
| publishDate |
2007-06-01 |
| 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). |
| url |
https://www.mais-journal.ru/jour/article/view/1118 |
| work_keys_str_mv |
AT grchelnokov onthenumberofrestrictionsdeterminingaperiodicalsequence |
| _version_ |
1721256657485299712 |