Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/51422
Title: CONSTRUCTING PREMAXIMAL BINARY CUBE-FREE WORDS OF ANY LEVEL
Authors: Petrova, Elena A.
Shur, Arseny M.
Issue Date: 2012
Citation: Petrova E. A. CONSTRUCTING PREMAXIMAL BINARY CUBE-FREE WORDS OF ANY LEVEL / Elena A. Petrova, Arseny M. Shur // International Journal of Foundations of Computer Science. — 2012. — Vol. 23. — № 8. — P. 1595-1609.
Abstract: 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. © 2012 World Scientific Publishing Company.
Keywords: CONTEXT
CUBE-FREE WORD
FACTOR ORDER
PREMAXIMAL WORD
URI: http://hdl.handle.net/10995/51422
https://elar.urfu.ru/handle/10995/51422
SCOPUS ID: 84875310531
WOS ID: 000316500200003
PURE ID: 1066233
ISSN: 0129-0541
1793-6373
DOI: 10.1142/S0129054112400643
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.