More characterizations of morphic words

DOI10.1016/J.TCS.2026.115875MaRDI QIDQ7229620zbMATH OpenFDO

Authors Golnaz Badkobeh, Pascal Ochem

Publication date 16 April 2026

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

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115875

zbMATH Keywords

combinatorics on wordspattern avoidance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A generator of morphisms for infinite words
• Antisquares and critical exponents
• Avoidability of formulas with two variables
• Avoidability of palindrome patterns
• Avoiding square-free words on free groups
• Binary words avoiding the pattern AABBCABBA
• Characterization of some binary words with few squares
• Complement avoidance in binary words
• Critical exponent of binary words with few distinct palindromes
• Doubled patterns are 3-avoidable
• Doubled patterns with reversal and square-free doubled patterns
• Fewest repetitions versus maximal-exponent powers in infinite binary words
• Growth problems for avoidable words
• Growth properties of power-free languages
• Infinite binary words containing repetitions of odd period
• On some interesting ternary formulas
• Polynomial versus exponential growth in repetition-free binary words
• Properties of a ternary infinite word
• Sur un théorème de Thue
• The analog of overlap-freeness for the period-doubling sequence
• The simplest binary word with only three squares
• Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen.
• Über unendliche Zeichenreihen.
• Which graphs allow infinite nonrepetitive walks?

This page was built for publication: More characterizations of morphic words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229620)