scientific article

zbMath0571.68054MaRDI QIDQ3687735

Michel Leconte

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

power-free wordspower-free morphism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

A powerful abelian square-free substitution over 4 letters ⋮ Finitary codes for biinfinite words ⋮ If a DOL language is k-power free then it is circular ⋮ A uniform cube-free morphism isk-power-free for all integersk≥ 4 ⋮ The entropy of square-free words ⋮ Abelian squares are avoidable on 4 letters ⋮ On codes with finite interpreting delay: a defect theorem ⋮ Some results on \(k\)-power-free morphisms ⋮ A test-set fork-power-free binary morphisms

This page was built for publication: