Pattern avoidance by palindromes / Mikhailova I. A.,Volkov M. V. // THEORETICAL COMPUTER SCIENCE. - 2009. - V. 410, l. 30-32. - P. 2992-2998.

ISSN/EISSN:

0304-3975 / нет данных

Type:

Article

Abstract:

We show that every avoidable pattern can be avoided by an infinite sequence of palindromes over a fixed finite alphabet. (C) 2009 Elsevier B.V. All rights reserved.

Author keywords:

Word; Palindrome; Morphism; Avoidable pattern INFINITE WORDS; COMPLEXITY

DOI:

10.1016/j.tcs.2009.01.037

Web of Science ID:

ISI:000268617400021

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

—

Другие поля

Поле	Значение
Month	AUG 20
Publisher	ELSEVIER SCIENCE BV
Address	PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
Language	English
Keywords-Plus	INFINITE WORDS; COMPLEXITY
Research-Areas	Computer Science
Web-of-Science-Categories	Computer Science, Theory \& Methods
Author-Email	Inna.Mikhaylova@gmail.com Mikhail.Volkov@usu.ru
ResearcherID-Numbers	Volkov, Mikhail/F-1407-2014
ORCID-Numbers	Volkov, Mikhail/0000-0002-9327-243X
Number-of-Cited-References	13
Journal-ISO	Theor. Comput. Sci.
Doc-Delivery-Number	478VT