Loading…
A SHORT PROOF OF A THEOREM OF COBHAM ON SUBSTITUTIONS
This paper is concerned with the lengths of constant length substitutions that generate topologically conjugate systems. We show that if the systems are infinite, then these lengths must be powers of the same integer. This result is a dynamical formulation of a special case of a 1969 theoretical com...
Saved in:
Published in: | The Rocky Mountain journal of mathematics 2014-01, Vol.44 (1), p.19-22 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper is concerned with the lengths of constant length substitutions that generate topologically conjugate systems. We show that if the systems are infinite, then these lengths must be powers of the same integer. This result is a dynamical formulation of a special case of a 1969 theoretical computer science result of Cobham [1]. Our proof is rather simple. |
---|---|
ISSN: | 0035-7596 1945-3795 |
DOI: | 10.1216/RMJ-2014-44-1-19 |