Asynchronous sliding block maps

Issue		RAIRO-Theor. Inf. Appl. Volume 34, Number 2, March-April 2000


Page(s)		139 - 156
DOI		10.1051/ita:2000111

DOI: 10.1051/ita:2000111
Theoret. Informatics Appl. 34 (2000) 139-156

Marie-Pierre Béal
Institut Gaspard Monge, CNRS, Université de Marne-la-Vallée, 5 boulevard Descartes, 77454 Marne-la-Vallée Cedex 2, France; (Marie-Pierre.Beal@univ-mlv.fr) and Url: http://www-igm.univ-mlv.fr/~beal/

Olivier Carton
Institut Gaspard Monge, CNRS, Université de Marne-la-Vallée, 5 boulevard Descartes, 77454 Marne-la-Vallée Cedex 2, France; (Olivier.Carton@univ-mlv.fr) and Url: http://www-igm.univ-mlv.fr/~carton/

Received December 9, 1999. Accepted May 23, 2000

Abstract: We define a notion of asynchronous sliding block map that can be realized by transducers labeled in $A^* \times B^*$ . We show that, under some conditions, it is possible to synchronize this transducer by state splitting, in order to get a transducer which defines the same sliding block map and which is labeled in $A \times B^k$ , where k is a constant integer. In the case of a transducer with a strongly connected graph, the synchronization process can be considered as an implementation of an algorithm of Frougny and Sakarovitch for synchronization of rational relations of bounded delay. The algorithm can be applied in the case where the transducer has a constant integer transmission rate on cycles and has a strongly connected graph. It keeps the locality of the input automaton of the transducer. We show that the size of the sliding window of the synchronous local map grows linearly during the process, but that the size of the transducer is intrinsically exponential. In the case of non strongly connected graphs, the algorithm of Frougny and Sakarovitch does not keep the locality of the input automaton of the transducer. We give another algorithm to solve this case without losing the good dynamic properties that guaranty the state splitting process.

AMS Subject Classification: 37B10, 68Q45.

Communicated by: J. Berstel

What is OpenURL?

The OpenURL standard is a protocol for transmission of metadata describing the resource that you wish to access. An OpenURL link contains article metadata and directs it to the OpenURL server of your choice. The OpenURL server can provide access to the resource and also offer complementary services (specific search engine, export of references...). The OpenURL link can be generated by different means.

If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.