CONSTRUCTING PREMAXIMAL BINARY CUBE-FREE WORDS OF ANY LEVEL / Petrova Elena A.,Shur Arseny M. // INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. - 2012. - V. 23, l. 8, SI. - P. 1595-1609.

ISSN/EISSN:

0129-0541 / нет данных

Type:

Article

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. Vie show the existence of such words with arbitrarily long finite extensions, both to one side and to both sides.

Author keywords:

Cube-free word; factor order; context; premaximal word MORPHISMS; LANGUAGES; PATTERNS

DOI:

10.1142/S0129054112400643

Web of Science ID:

ISI:000316500200003

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	DEC
Publisher	WORLD SCIENTIFIC PUBL CO PTE LTD
Address	5 TOH TUCK LINK, SINGAPORE 596224, SINGAPORE
Language	English
Keywords-Plus	MORPHISMS; LANGUAGES; PATTERNS
Research-Areas	Computer Science
Web-of-Science-Categories	Computer Science, Theory \& Methods
Author-Email	captain@akado-ural.ru arseny.shur@usu.ru
Number-of-Cited-References	17
Usage-Count-Since-2013	2
Journal-ISO	Int. J. Found. Comput. Sci.
Doc-Delivery-Number	111EA