Geodesic
Function transformations with automata
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part IV, Tome 402 (2012), pp. 148-169 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

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. 
@article{ZNSL_2012_402_a8,
     author = {T. Sallinen},
     title = {Function transformations with automata},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {148--169},
     year = {2012},
     volume = {402},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2012_402_a8/}
}
TY  - JOUR
AU  - T. Sallinen
TI  - Function transformations with automata
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2012
SP  - 148
EP  - 169
VL  - 402
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2012_402_a8/
LA  - en
ID  - ZNSL_2012_402_a8
ER  - 
%0 Journal Article
%A T. Sallinen
%T Function transformations with automata
%J Zapiski Nauchnykh Seminarov POMI
%D 2012
%P 148-169
%V 402
%U http://geodesic.mathdoc.fr/item/ZNSL_2012_402_a8/
%G en
%F ZNSL_2012_402_a8
T. Sallinen. Function transformations with automata. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part IV, Tome 402 (2012), pp. 148-169. http://geodesic.mathdoc.fr/item/ZNSL_2012_402_a8/

[1] K. Culik II, I. Fris, “Weighted finite transducers in image processing”, Discrete Applied Mathematics, 58:3 (1995), 223–237 | DOI | MR | Zbl

[2] K. Culik II, J. Karhumäki, “Finite automata computing real functions”, SIAM J. Comput., 23 (1994), 789–814 | DOI | MR | Zbl

[3] K. Culik II, J. Kari, “Finite state transformation of images”, Computers Graphics, 20:1 (1996), 125–135 | DOI | MR

[4] D. Derencourt, Juhani Karhumäki, M. Latteux, A. Terlutte, “On continuous functions computed by finite automata”, RAIRO-Theor. Inf. Appl., 29 (1994), 387–403 | MR

[5] J. Karhumäki, J. Kari, “Finite automata, image manipulation and automatic real functions”, Handbook of Automata, European Mathematical Society (to appear) | Zbl

[6] J. Karhumäki, T. Sallinen, “Weighted finite automata: computing with different topologies”, Unconventional Computation, Lect. Notes Computer Sci., 6714, eds. Calude Cristian, Kari Jarkko, Petre Ion, Rozenberg Grzegorz, 2011, 14–33 | DOI | MR | Zbl

[7] T. Sallinen, Reaalifunktioiden laskennasta automaateilla, University of Turku, 2009

[8] M. P. Schützenberger, “On the definition of a family of automata”, Information and Control, 4 (1961), 245–270 | DOI | MR | Zbl