Polynomial-time algorithm for fixed points of nontrivial morphisms
type: Item
instance of: scholarly article
title: Polynomial-time algorithm for fixed points of nontrivial morphisms
zbMATH Open document ID: 1187.68364
author: Štěpán Holub
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5648048
zbMATH Keywords: fixed point
zbMATH Keywords: morphical primitivity
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
full work available at URL: j.disc.2009.03.019
OpenAlex ID: W2046738730
cites work: Finding a homomorphism between two words is NP-complete
cites work: Fixed languages and the adult languages of ol schemest†
cites work: Q3711767
cites work: Morphically primitive words
cites work: On two-sided infinite fixed points of morphisms
DOI: 10.1016/J.DISC.2009.03.019
description: scientific article; zbMATH DE number 5648048