Pattern avoidance by palindromes

DOI10.1016/j.tcs.2009.01.037zbMath1173.68054OpenAlexW2033717958MaRDI QIDQ2271438

Inna A. Mikhailova, Mikhail V. Volkov

Publication date: 7 August 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.037

zbMATH Keywords

palindromemorphismwordavoidable pattern

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

Synchronizing Automata of Bounded Rank

Cites Work

• Unnamed Item
• Unnamed Item
• Pattern avoidance: themes and variations
• Avoidable patterns in strings of symbols
• Palindrome complexity.
• A note on antichains of words
• Palindromic complexity of infinite words associated with simple Parry numbers
• Factor versus palindromic complexity of uniformly recurrent infinite words
• BLOCKING SETS OF TERMS
• PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS

This page was built for publication: Pattern avoidance by palindromes