Skip to main content
SpringerLink
Log in

Finite State Transducers for Modular Möbius Number Systems

  • Conference paper
Mathematical Foundations of Computer Science 2012 (MFCS 2012)

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

Abstract

Modular Möbius number systems consist of Möbius transformations with integer coefficients and unit determinant. We show that in any modular Möbius number system, the computation of a Möbius transformation with integer coefficients can be performed by a finite state transducer and has linear time complexity. As a byproduct we show that every modular Möbius number system has the expansion subshift of finite type.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.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. Gosper, R.W.: Continued fractions arithmetic. Unpublished manuscript (1977), http://www.tweedledum.com/rwg/cfup.htm

  2. Heckmann, R.: Big integers and complexity issues in exact real arithmetic. Electr. Notes Theor. Comput. Sci. 13 (1998)

    Google Scholar 

  3. Konečný, M.: Real functions incrementally computable by finite automata. Theoretical Computer Science 315(1), 109–133 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kornerup, P., Matula, D.W.: An algorithm for redundant binary bit-pipelined rational arithmetic. IEEE Transactions on Computers 39(8), 1106–1115 (1990)

    Article  Google Scholar 

  5. Kůrka, P.: Topological and symbolic dynamics, Cours spécialisés, vol. 11. Société Mathématique de France, Paris (2003)

    Google Scholar 

  6. Kůrka, P.: Möbius number systems with sofic subshifts. Nonlinearity 22, 437–456 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kůrka, P.: Expansion of rational numbers in Möbius number systems. In: Kolyada, S., Manin, Y., Moller, M. (eds.) Dynamical Numbers: Interplay between Dynamical Systems and Number Theory. Contemporary Mathematics, vol. 532, pp. 67–82. American Mathematical Society (2010)

    Google Scholar 

  8. Kůrka, P.: Fast arithmetical algorithms in Möbius number systems. IEEE Transactions on Computers 61(8), 1097–1109 (2012)

    Article  Google Scholar 

  9. Kůrka, P.: Stern-Brocot graph in Möbius number systems. Nonlinearity 25, 57–72 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kůrka, P., Kazda, A.: Möbius number systems based on interval covers. Nonlinearity 23, 1031–1046 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  12. Niqui, M.: Exact real arithmetic on the Stern-Brocot tree. J. Discrete Algorithms 5(2), 356–379 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Potts, P.J.: Exact real arithmetic using Möbius transformations. PhD thesis, University of London, Imperial College, London (1998)

    Google Scholar 

  14. Raney, G.N.: On continued fractions and finite automata. Mathematische Annalen 206, 265–283 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  15. Vuillemin, J.E.: Exact real computer arithmetic with continued fractions. IEEE Transactions on Computers 39(8), 1087–1105 (1990)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Marseille, 39 rue Joliot Curie, F-13453, Marseille Cedex, France

    Martin Delacourt

  2. Center for Theoretical Study, Academy of Sciences and Charles University in Prague, Jilská 1, CZ-11000, Praha 1, Czechia

    Petr Kůrka

Authors
  1. Martin Delacourt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petr Kůrka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynska Dolina, 84248, Bratislava, Slovakia

    Branislav Rovan

  2. Department of Electronics and Computer Science, University of Southampton, SO17 1BJ, Southampton, UK

    Vladimiro Sassone

  3. Institute of Theoretical Computer Science, ETH Zürich, CAB H 39.2, Universitätstrasse 6, 8092, Zürich, Switzerland

    Peter Widmayer

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Delacourt, M., Kůrka, P. (2012). Finite State Transducers for Modular Möbius Number Systems. In: Rovan, B., Sassone, V., Widmayer, P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32589-2_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32589-2_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32588-5

  • Online ISBN: 978-3-642-32589-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation