Binary operations on automatic functions
Karhumäki, Juhani ; Kari, Jarkko ; Kupke, Joachim1
1 ETH Zurich, Switzerland;
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 2, pp. 217-236.

Real functions on the domain [0,1) n - often used to describe digital images - allow for different well-known types of binary operations. In this note, we recapitulate how weighted finite automata can be used in order to represent those functions and how certain binary operations are reflected in the theory of these automata. Different types of products of automata are employed, including the seldomly-used full cartesian product. We show, however, the infeasibility of functional composition; simple examples yield that the class of automatic functions (i.e., functions computable by automata) is not closed under this operation.

DOI : 10.1051/ita:2007036
Classification : 68Q45, 68Q10, 68U10
Mots-clés : automatic functions, weighted finite automata, full cartesian product
Karhumäki, Juhani  ; Kari, Jarkko  ; Kupke, Joachim 1

1 ETH Zurich, Switzerland; 
@article{ITA_2008__42_2_217_0,
     author = {Karhum\"aki, Juhani and Kari, Jarkko and Kupke, Joachim},
     title = {Binary operations on automatic functions},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {217--236},
     publisher = {EDP-Sciences},
     volume = {42},
     number = {2},
     year = {2008},
     doi = {10.1051/ita:2007036},
     mrnumber = {2401259},
     zbl = {1144.68034},
     language = {en},
     url = {http://archive.numdam.org/articles/10.1051/ita:2007036/}
}
TY  - JOUR
AU  - Karhumäki, Juhani
AU  - Kari, Jarkko
AU  - Kupke, Joachim
TI  - Binary operations on automatic functions
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2008
SP  - 217
EP  - 236
VL  - 42
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/articles/10.1051/ita:2007036/
DO  - 10.1051/ita:2007036
LA  - en
ID  - ITA_2008__42_2_217_0
ER  - 
%0 Journal Article
%A Karhumäki, Juhani
%A Kari, Jarkko
%A Kupke, Joachim
%T Binary operations on automatic functions
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2008
%P 217-236
%V 42
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/articles/10.1051/ita:2007036/
%R 10.1051/ita:2007036
%G en
%F ITA_2008__42_2_217_0
Karhumäki, Juhani; Kari, Jarkko; Kupke, Joachim. Binary operations on automatic functions. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 42 (2008) no. 2, pp. 217-236. doi : 10.1051/ita:2007036. http://archive.numdam.org/articles/10.1051/ita:2007036/

[1] J. Berstel and M. Morcrette, Compact representation of patterns by finite automata, in Proc. Pixim '89, Paris (1989) 387-402.

[2] V. Blondel, J. Theys and J. Tsitsiklis, When is a pair of matrices stable? Problem 10.2 in Unsolved problems in Mathematical Systems and Control Theory. Princeton Univ. Press (2004) 304-308.

[3] K. Culik Ii and S. Dube, Rational and affine expressions for image descriptions. Discrete Appl. Math. 41 (1993) 85-120. | MR | Zbl

[4] K. Culik Ii and I. Friš, Weighted finite transducers in image processing. Discrete Appl. Math. 58 (1995) 223-237. | MR | Zbl

[5] K. Culik Ii and J. Karhumäki, Finite automata computing real functions. SIAM J. Comput. 23 (1994) 789-814. | MR | Zbl

[6] K. Culik Ii and J. Kari, Image compression using weighted finite automata. Comput. Graph. 17 (1993) 305-313. | MR

[7] K. Culik Ii and J. Kari, Efficient inference algorithms for weighted finite automata, in Fractal Image Compression, edited by Y. Fisher, Springer (1994).

[8] K. Culik Ii and J. Kari, Digital Images and Formal Languages, in Handbook of Formal Languages, Vol. III, edited by G. Rozenberg and A. Salomaa, Springer (1997) 599-616. | MR

[9] D. Derencourt, J. Karhumäki, M. Latteux and A. Terlutte, On computational power of weighted finite automata, in Proc. 17th MFCS. Lect. Notes Comput. Sci. 629 (1992) 236-245. | MR

[10] D. Derencourt, J. Karhumäki, M. Latteux and A. Terlutte, On continuous functions computed by finite automata. RAIRO-Theor. Inf. Appl. 29 (1994) 387-403. | Numdam | MR | Zbl

[11] J. Karhumäki, W. Plandowski and W. Rytter, The complexity of compressing subsegments of images described by finite automata. Discrete Appl. Math. 125 (2003) 235-254. | MR | Zbl

[12] K. Knopp, Infinite Sequences and Series. Dover publications (1956). | MR | Zbl

[13] J. Kupke, On Separating Constant from Polynomial Ambiguity of Finite Automata, in Proc. 32nd SOFSEM. Lect. Notes Comput. Sci. 3831 (2006) 379-388.

[14] J. Kupke, Limiting the Ambiguity of Non-Deterministic Finite Automata. PhD. Thesis. Aachen University, 2002. Available online at http://www-i1.informatik.rwth-aachen.de/ joachimk/ltaondfa.ps http://www-i1.informatik.rwth-aachen.de/∼joachimk/ltaondfa.ps

Cité par Sources :