Weighted finite automata: computing with different topologies

Authors:
Juhani Karhumäki;Turo Sallinen
Affiliations:
Department of Mathematics and Turku Centre for Computer Science, University of Turku, Turku, Finland;Department of Mathematics and Turku Centre for Computer Science, University of Turku, Turku, Finland
Venue:
UC'11 Proceedings of the 10th international conference on Unconventional computation
Year:
2011

Citing 4
Cited 0

Finite Automata Computing Real Functions

SIAM Journal on Computing
Automata, Languages, and Machines

Automata, Languages, and Machines
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series
Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu

Quantified Score

Hi-index	0.00

Visualization

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.