Constructing Premaximal Ternary Square-Free Words of Any Level / Petrova Elena A.,Shur Arseny M. // . - 2012. - V. 7464, l. . - P. 752-763.

ISSN/EISSN:

0302-9743 / нет данных

Type:

Proceedings Paper

Abstract:

We study extendability of ternary square-freewords. Namely, we are interested in the square-free words that cannot be infinitely extended preserving square-freeness. We prove that any positive integer is the length of the longest extension of some ternary square-free word and thus solve an open problem by Allouche and Shallit. We also resolve the two-sided version of this problem.

Author keywords:

нет данных

DOI:

нет данных

Web of Science ID:

ISI:000371253900065

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

—

Другие поля

Поле	Значение
Editor	Rovan, B and Sassone, V and Widmayer, P
Booktitle	MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012
Series	Lecture Notes in Computer Science
Note	37th International Symposium on Mathematical Foundations of Computer Science, (MFCS), Bratislava, SLOVAKIA, AUG 27-31, 2012
Organization	Slovak Soc Comp Sci; Comenius Univ, Fac Math Phys \& Informat
Publisher	SPRINGER-VERLAG BERLIN
Address	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Language	English
ISBN	978-3-642-32589-2; 978-3-642-32588-5
Research-Areas	Computer Science; Mathematics; Science \& Technology - Other Topics
Web-of-Science-Categories	Computer Science, Theory \& Methods; Mathematics; Logic
Author-Email	captain@akado-ural.ru arseny.shur@usu.ru
Number-of-Cited-References	9
Doc-Delivery-Number	BE3TA