|
Zapiski Nauchnykh Seminarov POMI, 2012, Volume 402, Pages 148–169
(Mi znsl5242)
|
|
|
|
Function transformations with automata
T. Sallinen Department of Mathematics and Turku Centre for Computer Science (TUCS), University of Turku, Turku, Finland
Abstract:
We use conventional models of computations to define rather unconventional computational processes. Specifically, we use one-tape automata to compute real-valued functions and two-tape automata to describe transformations of those functions. As transformations we consider the integration and the derivation of a function.
Key words and phrases:
weighted finite automaton, weighted finite transducer, real-valued function, derivative, integral.
Received: 07.09.2012
Citation:
T. Sallinen, “Function transformations with automata”, Combinatorics and graph theory. Part IV, RuFiDiM'11, Zap. Nauchn. Sem. POMI, 402, POMI, St. Petersburg, 2012, 148–169; J. Math. Sci. (N. Y.), 192:3 (2013), 339–351
Linking options:
https://www.mathnet.ru/eng/znsl5242 https://www.mathnet.ru/eng/znsl/v402/p148
|
Statistics & downloads: |
Abstract page: | 120 | Full-text PDF : | 34 | References: | 55 |
|