Skip to main content

Eigenvalues and Transduction of Morphic Sequences

  • Conference paper
Developments in Language Theory (DLT 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8633))

Included in the following conference series:

Abstract

We study finite state transduction of automatic and morphic sequences. Dekking [4] proved that morphic sequences are closed under transduction and in particular morphic images. We present a simple proof of this fact, and use the construction in the proof to show that non-erasing transductions preserve a condition called α-substitutivity. Roughly, a sequence is α-substitutive if the sequence can be obtained as the limit of iterating a substitution with dominant eigenvalue α. Our results culminate in the following fact: for multiplicatively independent real numbers α and β, if v is a α-substitutive sequence and w is an β-substitutive sequence, then v and w have no common non-erasing transducts except for the ultimately periodic sequences. We rely on Cobham’s theorem for substitutions, a recent result of Durand [5].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, New York (2003)

    Book  Google Scholar 

  2. Cobham, A.: On the Hartmanis-Stearns problem for a class of tag machines. In: IEEE Conference Record of 1968 Ninth Annual Symposium on Switching and Automata Theory, pp. 51–60 (1968)

    Google Scholar 

  3. Cobham, A.: Uniform tag sequences. Math. Systems Theory 6, 164–192 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dekking, F.M.: Iteration of maps by an automaton. Discrete Math. 126, 81–86 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. Durand, F.: Cobham’s theorem for substitutions. Journal of the European Mathematical Society 13, 1797–1812 (2011)

    Article  Google Scholar 

  6. Endrullis, J., Hendriks, D., Klop, J.W.: Degrees of Streams. Integers 11B(A6), 1–40 (2011), proceedings of the Leiden Numeration Conference 2010

    Google Scholar 

  7. Pansiot, J.J.: Hiérarchie et fermeture de certaines classes de tag-systèmes. Acta Inform. 20(2), 179–196 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  8. Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)

    Google Scholar 

  9. Sprunger, D., Tune, W., Endrullis, J., Moss, L.S.: Eigenvalues and transduction of morphic sequences: Extended version. Tech. rep., CoRR (2014), http://arxiv.org/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Sprunger, D., Tune, W., Endrullis, J., Moss, L.S. (2014). Eigenvalues and Transduction of Morphic Sequences. In: Shur, A.M., Volkov, M.V. (eds) Developments in Language Theory. DLT 2014. Lecture Notes in Computer Science, vol 8633. Springer, Cham. https://doi.org/10.1007/978-3-319-09698-8_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09698-8_21

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09697-1

  • Online ISBN: 978-3-319-09698-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics