Morphic primitivity and alphabet reductions

Authors:
Hossein Nevisi;Daniel Reidenbach
Affiliations:
Department of Computer Science, Loughborough University, Loughborough, Leicestershire, UK;Department of Computer Science, Loughborough University, Loughborough, Leicestershire, UK
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 4
Cited 0

On a conjecture about finite fixed points of morphisms

Theoretical Computer Science - Combinatorics on words
Morphically primitive words

Theoretical Computer Science
Restricted ambiguity of erasing morphisms

Theoretical Computer Science
Weakly unambiguous morphisms

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

An alphabet reduction is a 1-uniform morphism that maps a word to an image that contains a smaller number of different letters. In the present paper we investigate the effect of alphabet reductions on morphically primitive words, i.,e., words that are not a fixed point of a nontrivial morphism. Our first main result answers a question on the existence of unambiguous alphabet reductions for such words, and our second main result establishes whether alphabet reductions can be given that preserve morphic primitivity. In addition to this, we study Billaud's Conjecture --- which features a different type of alphabet reduction, but is otherwise closely related to the main subject of our paper --- and prove its correctness for a special case.