Skip to main content
Springer Nature Link
Log in

Weighted Finite Automata: Computing with Different Topologies

  • Conference paper
Unconventional Computation (UC 2011)

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

Included in the following conference series:

  • 640 Accesses

Abstract

We use a very conventional model of computation to define unconventional computational processes. This leads to an easily computable class of real functions, however, this class is very different to those of nicely behaving real functions in a classical sense. All this is based on the fact that the topology of the unit interval is very different to that of infinite words representing numbers in that interval. In addition, the very inherent recursive structure of finite automata is central here.

Work supported by the Academy of Finland project 121419.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Berstel, J., Reutenauer, C.: Noncommutative rational series with applications. Encyclopedia of Mathematics and its Applications, (137). Cambridge University Press, Cambridge (2010)

    Book  MATH  Google Scholar 

  2. Culik II, K., Karhumäki, J.: Finite automata computing real functions. SIAM J. Comput. 23, 789–814 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Derencourt, D., Karhumäki, J., Latteux, M., Terlutte, A.: On continuous functions computed by finite automata. RAIRO-Theor. Inf. Appl. 29, 387–403 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Droste, M., Kari, J., Steinby, P.: Observations on the smoothness properties of real functions computed by weighted finite automata. Fund. Inform. 73(1,2), 99–106 (2006)

    MathSciNet  MATH  Google Scholar 

  5. Eilenberg, S.: Automata, languages and machines. Academic Press, London (1974)

    MATH  Google Scholar 

  6. Karhumäki, J., Kari, J.: Finite automata, image manipulation and automatic real functions. In: Handbook of Automata. European Mathematical Society (to appear)

    Google Scholar 

  7. Sallinen, T.: Reaalifunktioiden laskennasta automaateilla. Master’s thesis, University of Turku (2009)

    Google Scholar 

  8. Salomaa, A., Soittola, M.: Automata-theoretic aspects of formal power series. Springer, Heidelberg (1978)

    Book  MATH  Google Scholar 

  9. Schützenberger, M.P.: On the definition of a family of automata. Information and Control 4, 245–270 (1961)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Turku Centre for Computer Science (TUCS), University of Turku, FIN-20014, Turku, Finland

    Juhani Karhumäki & Turo Sallinen

Authors
  1. Juhani Karhumäki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Turo Sallinen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Science Centre, The University of Auckland, 38 Princes Street, 1142, Auckland, New Zealand

    Cristian S. Calude

  2. Department of Mathematics, University of Turku, 20014, Turku, Finland

    Jarkko Kari

  3. Department of Information Technologies, Åbo Akademi University, ICT Building, Joukahaisenkatu 3-5 A, 20520, Turku, Finland

    Ion Petre

  4. Leiden Institute of Center Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karhumäki, J., Sallinen, T. (2011). Weighted Finite Automata: Computing with Different Topologies. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds) Unconventional Computation. UC 2011. Lecture Notes in Computer Science, vol 6714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21341-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21341-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21340-3

  • Online ISBN: 978-3-642-21341-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics