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 |