The Billaud conjecture for \(|\varSigma| = 4\), and beyond

DOI10.1007/978-3-031-05578-2_17OpenAlexW4285158870MaRDI QIDQ2164000

Szymon Łopaciuk, Daniel Reidenbach

Publication date: 11 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-05578-2_17

zbMATH Keywords

fixed pointBillaud conjecturemorphic primitivity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On Billaud words and their companions

Cites Work

• Unnamed Item
• Linear-time version of Holub's algorithm for morphic imprimitivity testing
• On a conjecture about finite fixed points of morphisms
• Pattern expressions and pattern automata
• Discontinuities in pattern inference
• Morphically primitive words
• Polynomial-time algorithm for fixed points of nontrivial morphisms
• Langages infinitaires et produit de mixage
• Morphic Primitivity and Alphabet Reductions
• Fixed languages and the adult languages of ol schemest^†
• Complexity of testing morphic primitivity
• Mappings of languages by two-tape devices

This page was built for publication: The Billaud conjecture for \(|\varSigma| = 4\), and beyond