Construction of a bi-infinite power free word with a given factor and a non-recurrent letter

DOI10.1007/978-3-031-34326-1_12zbMath1529.68242arXiv2202.12038MaRDI QIDQ6175097

Josef Rukavicka

Publication date: 17 August 2023

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.12038

zbMATH Keywords

extension propertypower-free wordsrecurrent factor

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Subword complexity and power avoidance
• Two-Sided Bounds for the Growth Rates of Power-Free Languages
• Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters
• Growth Properties of Power-Free Languages
• Transition property for cube-free words

This page was built for publication: Construction of a bi-infinite power free word with a given factor and a non-recurrent letter