Note: On the simplification of infinite morphic words

Authors:
Juha Honkala
Affiliations:
Department of Mathematics, University of Turku, 20014 Turku, Finland
Venue:
Theoretical Computer Science
Year:
2009

Citing 3
Cited 1

Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations
Cancellation and periodicity properties of iterated morphisms

Theoretical Computer Science
On the hartmanis-stearns problem for a class of tag machines

SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)

Numeration systems: a link between number theory and formal language theory

DLT'10 Proceedings of the 14th international conference on Developments in language theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study the simplification of infinite morphic words by using elementary morphisms. In particular, we give a new proof of a result of Cobham, stating that a morphic image of a morphic word is a finite word or a morphic word.