Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/111972
Title: Constructing Premaximal Binary Cube-Free Words of Any Level
Authors: Petrova, E. A.
Shur, A. M.
Issue Date: 2011
Publisher: Open Publishing Association
Open Publishing Association
Citation: Petrova E. A. Constructing Premaximal Binary Cube-Free Words of Any Level / E. A. Petrova, A. M. Shur. — DOI 10.1038/s41598-022-05894-5 // Electronic Proceedings in Theoretical Computer Science, EPTCS. — 2011. — Vol. 63. — P. 168-178.
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. © 2011 E. A. Petrova, A. M. Shur.
Keywords: COMPUTATIONAL METHODS
COMPUTER SCIENCE
FINITE EXTENSION
GEOMETRY
URI: http://hdl.handle.net/10995/111972
Access: info:eu-repo/semantics/openAccess
Conference name: 8th International Conference Words, WORDS 2011
Conference date: 12 September 2011 through 16 September 2011
SCOPUS ID: 84864984242
ISSN: 2075-2180
DOI: 10.1038/s41598-022-05894-5
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-84864984242.pdf130,75 kBAdobe PDFView/Open


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