• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Weighted Finite Automata: Computing with Different Topologies

Juhani Karhumäki, Turo Sallinen, Weighted Finite Automata: Computing with Different Topologies. In: Cristian Calude, Jarkko Kari, Ion Petre, Grzegorz Rozenberg (Eds.), Proceedings of the 10th International Conference on Unconventional Computation, 14-33, Springer, 2011.

http://dx.doi.org/10.1007/978-3-642-21341-0

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.

BibTeX entry:

@INPROCEEDINGS{inpKaSa11a,
  title = {Weighted Finite Automata: Computing with Different Topologies},
  booktitle = {Proceedings of the 10th International Conference on Unconventional Computation},
  author = {Karhumäki, Juhani and Sallinen, Turo},
  editor = {Calude, Cristian and Kari, Jarkko and Petre, Ion and Rozenberg, Grzegorz},
  publisher = {Springer},
  pages = {14-33},
  year = {2011},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication