Constructing premaximal binary cube-free words of any level
Электронный научный архив УРФУ
Информация об архиве | Просмотр оригинала| Поле | Значение | |
| Заглавие |
Constructing premaximal binary cube-free words of any level
|
|
| Автор |
Petrova, E. A.
Shur, A. M. |
|
| Тематика |
COMPUTATIONAL METHODS
COMPUTER SCIENCE FINITE EXTENSION GEOMETRY |
|
| Описание |
We study the structure of the language of binary cube-free words. Namely, we are interested in the cube-free words that cannot be infinitely extended preserving cube-freeness. We show the existence of such words with arbitrarily long finite extensions, both to one side and to both sides. © 2011 E. A. Petrova, A. M. Shur.
|
|
| Дата |
2024-04-24T12:38:24Z
2024-04-24T12:38:24Z 2011 |
|
| Тип |
Article
Journal article (info:eu-repo/semantics/article) Published version (info:eu-repo/semantics/publishedVersion) |
|
| Идентификатор |
Petrova, E. A., & Shur, A. M. (2011). Constructing premaximal binary cube-free words of any level. Electronic Proceedings in Theoretical Computer Science, 63, 168–178. doi:10.4204/eptcs.63.23
2075-2180 Final All Open Access, Gold, Green https://arxiv.org/pdf/1108.3634 http://elar.urfu.ru/handle/10995/132578 10.4204/EPTCS.63.23 |
|
| Язык |
en
|
|
| Права |
Open access (info:eu-repo/semantics/openAccess)
cc-by-nc-nd |
|
| Формат |
application/pdf
|
|
| Издатель |
Open Publishing Association
|
|
| Источник |
Electronic Proceedings in Theoretical Computer Science
Electronic Proceedings in Theoretical Computer Science, EPTCS |
|