Pattern avoidance by palindromes

Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/75715

Title:	Pattern avoidance by palindromes
Authors:	Mikhailova, I. A. Volkov, M. V.
Issue Date:	2009
Publisher:	Elsevier B.V.
Citation:	Mikhailova I. A. Pattern avoidance by palindromes / I. A. Mikhailova, M. V. Volkov // Theoretical Computer Science. — 2009. — Vol. 410. — Iss. 30-32. — P. 2992-2998.
Abstract:	We show that every avoidable pattern can be avoided by an infinite sequence of palindromes over a fixed finite alphabet. © 2009 Elsevier B.V. All rights reserved.
Keywords:	AVOIDABLE PATTERN MORPHISM PALINDROME WORD AVOIDABLE PATTERN FINITE ALPHABET MORPHISM PALINDROME PATTERN AVOIDANCE WORD
URI:	http://elar.urfu.ru/handle/10995/75715
Access:	info:eu-repo/semantics/openAccess
SCOPUS ID:	67649671867
WOS ID:	000268617400021
PURE ID:	7881567
ISSN:	0304-3975
DOI:	10.1016/j.tcs.2009.01.037
Appears in Collections:	Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:

There are no files associated with this item.