A characterization of power-free morphisms
type: Item
instance of: scholarly article
title: A characterization of power-free morphisms
zbMATH Open document ID: 0572.68066
DOI: 10.1016/0304-3975(85)90213-0
author: Michel Leconte
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
review text: A word is called k th power-free if it does not contain any non-empty factor \(u^ k\). A morphism is k th power-free if it preserves k th power-free words. A morphism is power-free if it is k th power-free for every \(k>1\). We show that it is decidable whether a morphism is power- free; more precisely, we prove that a morphism h is power-free iff: h is a square-free morphism and, for each letter a, the image \(h(a^ 2)\) is cube-free.
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 20M35
zbMATH DE Number: 3913710
zbMATH Keywords: power-free words
MaRDI profile type: Publication
full work available at URL: 0304-3975(85)90213-0
OpenAlex ID: W2074361486
cites work: Avoidable patterns in strings of symbols
cites work: Q3860007
cites work: Sharp characterizations of squarefree morphisms
cites work: Q3968470
cites work: Q4529547
cites work: Q3948608
description: scientific article; zbMATH DE number 3913710