RAIRO-Theor. Inf. Appl.
Volume 42, Number 2, April-June 2008
|Page(s)||217 - 236|
|Published online||13 December 2007|
Binary operations on automatic functions
University of Turku, Finland;
2 ETH Zurich, Switzerland; email@example.com
Accepted: 2 May 2006
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.
Mathematics Subject Classification: 68Q45 / 68Q10 / 68U10
Key words: Automatic functions / weighted finite automata / full Cartesian product
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.