On Billaud words and their companions

DOI10.1016/j.tcs.2022.11.004OpenAlexW4308736581MaRDI QIDQ5925708

Daniel Reidenbach, Szymon Łopaciuk

Publication date: 20 April 2023

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

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

zbMATH Keywords

fixed pointBillaud conjecturemorphic primitivity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Linear-time version of Holub's algorithm for morphic imprimitivity testing
• On a conjecture about finite fixed points of morphisms
• Discontinuities in pattern inference
• Morphically primitive words
• Polynomial-time algorithm for fixed points of nontrivial morphisms
• The Billaud conjecture for \(|\varSigma| = 4\), and beyond
• Morphic Primitivity and Alphabet Reductions
• Fixed languages and the adult languages of ol schemest^†
• Complexity of testing morphic primitivity
• On Billaud words and their companions

This page was built for publication: On Billaud words and their companions