On the Number of Subword Reconstructions in the Binary Alphabet when Superimposed on one Character
The problem of obtaining accurate estimates of the number of reconstructions for words over a binary alphabet is considered. Subwords of different lengths from a given set are joined by the method of overlapping end characters. It is only possible to connect a pair of subwords where the last charact...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
The Fund for Promotion of Internet media, IT education, human development «League Internet Media»
2020-09-01
|
| Series: | Современные информационные технологии и IT-образование |
| Subjects: | |
| Online Access: | http://sitito.cs.msu.ru/index.php/SITITO/article/view/650 |