Fife's theorem for 7/3-powers
Электронный научный архив УРФУ
Информация об архиве | Просмотр оригинала| Поле | Значение | |
| Заглавие |
Fife's theorem for 7/3-powers
|
|
| Автор |
Rampersad, N.
Shallit, J. Shur, A. |
|
| Тематика |
COMPUTATIONAL METHODS
COMPUTER SCIENCE |
|
| Описание |
We prove a Fife-like characterization of the infinite binary 7/3-power-free words, by giving a finite automaton of 15 states that encodes all such words. As a consequence, we characterize all such words that are 2-automatic. © 2011 N. Rampersad.
|
|
| Дата |
2024-04-24T12:38:23Z
2024-04-24T12:38:23Z 2011 |
|
| Тип |
Article
Journal article (info:eu-repo/semantics/article) Published version (info:eu-repo/semantics/publishedVersion) |
|
| Идентификатор |
Rampersad, N., Shallit, J., & Shur, A. (2011). Fife’s theorem for (7/3)-powers. Electronic Proceedings in Theoretical Computer Science, 63, 189–198. doi:10.4204/eptcs.63.25
2075-2180 Final All Open Access, Gold https://arxiv.org/pdf/1104.3500 http://elar.urfu.ru/handle/10995/132576 10.4204/EPTCS.63.25 |
|
| Язык |
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 |
|