Abstract
We show that for arbitrary iterated morphisms g and h, one can decide if there exist integers p and q such that gp=hq. To show this result we first prove a similar property of integer matrices : given arbitrary integer matrices A and B one can decide if there exist integers p and q such that Ap=Bq.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Berstel J., Mignotte M. (1976), Deux propriétés décidables des suites récurrentes linéaires, Bull. Soc. Math. France 104 p 175–184.
Cobham A. (1972), Uniform Tag Sequences, Math. Systems Theory 6 p 164–192.
Culik K., Fris I. (1977), The decidability of the equivalence problem for DOL-Systems, Inf. and Control 35 p 20–39.
Culik K. and Salomaa A. (1980), On infinite words obtained by iterating morphisms, University of Waterloo, Research Report CS 29-80.
Nielsen M. (1974), On the decidability of some equivalence problems for DOL-Systems, Inf. and Control 25 p 166–193.
Van der Poorten A.J., Loxton J.H. (1977), Multiplicative relations in number fields, Bull. Austral. Math. Soc. 16 p 83–98.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pansiot, J.J. (1981). A decidable property of iterated morphisms. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017307
Download citation
DOI: https://doi.org/10.1007/BFb0017307
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive