Skip to main content
SpringerLink
Log in

Analytic Functions Computable by Finite State Transducers

  • Conference paper
Implementation and Application of Automata (CIAA 2014)

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

Included in the following conference series:

Abstract

We show that the only analytic functions computable by finite state transducers in sofic Möbius number systems are Möbius transformations.

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 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. Avizienis, A.: Signed-digit number representations for fast parallel arithmetic. IRE Transactions on Electronic Computers EC-10 (1961)

    Google Scholar 

  2. Beardon, A.F.: The geometry of discrete groups. Springer, Berlin (1995)

    Google Scholar 

  3. Delacourt, M., Kůrka, P.: Finite state transducers for modular möbius number systems. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 323–334. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Frougny, C.: On-line addition in real base. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 1–11. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. Gosper, R.W.: Continued fractions arithmetic (1977) (unpublished manuscript), http://www.tweedledum.com/rwg/cfup.htm

  6. Culik II, K., Karhumaki, J.: Finite automata computing real functions. SIAM Journal on Computing 23(4), 789–914 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kari, J., Kazda, A., Steinby, P.: On continuous weighted finite automata. Linear Algebra and its Applications 436, 1791–1824 (2012)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Kornerup, P., Matula, D.W.: Finite precision number systems and arithmetic. Cambridge University Press, Cambridge (2010)

    Book  MATH  Google Scholar 

  10. 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 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. Kůrka, P., Delacourt, M.: The unary arithmetical algorithm in bimodular number systems. In: 2013 IEEE 21st Symposium on Computer Arithmetic ARITH-21, pp. 127–134. IEEE Computer Society (2013)

    Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  16. 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. Center for Theoretical Study, Academy of Sciences and Charles University in Prague, Jilská 1, 11000, Praha 1, Czechia

    Petr Kůrka

  2. Department of Mathematics FNSPE, Czech Technical University in Prague, Trojanova 13, 12000, Praha 2, Czechia

    Tomáš Vávra

Authors
  1. Petr Kůrka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tomáš Vávra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstrasse 2, 35392, Giessen, Germany

    Markus Holzer  & Martin Kutrib  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kůrka, P., Vávra, T. (2014). Analytic Functions Computable by Finite State Transducers. In: Holzer, M., Kutrib, M. (eds) Implementation and Application of Automata. CIAA 2014. Lecture Notes in Computer Science, vol 8587. Springer, Cham. https://doi.org/10.1007/978-3-319-08846-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08846-4_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08845-7

  • Online ISBN: 978-3-319-08846-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation