Some results on \(k\)-power-free morphisms
type: Item
instance of: scholarly article
title: Some results on \(k\)-power-free morphisms
zbMATH Open document ID: 1014.68127
DOI: 10.1016/S0304-3975(00)00437-0
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 1768199
zbMATH Keywords: combinatorics on words
zbMATH Keywords: \(k\)-power-free words
zbMATH Keywords: morphisms
zbMATH Keywords: test-sets
author: Gwénaël Richomme
author: Francis Wlazinski
MaRDI profile type: Publication
cites work: Avoidable patterns in strings of symbols
cites work: Mots sans carre et morphismes iterés
cites work: A characterization of overlap-free morphisms
cites work: Uniformly growing k-th power-free homomorphisms
cites work: Q4714446
cites work: Sharp characterizations of squarefree morphisms
cites work: On cube-free \(\omega\)-words generated by binary morphisms
cites work: Q3741804
cites work: Q3687735
cites work: A characterization of power-free morphisms
cites work: Q4341774
cites work: Q4529547
cites work: If a DOL language is k-power free then it is circular
cites work: Characterization of test-sets for overlap-free morphisms
cites work: Q4501525
cites work: Sequences generated by infinitely iterated morphisms
full work available at URL: s0304-3975(00)00437-0
OpenAlex ID: W1990372213
description: scientific article; zbMATH DE number 1768199