The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Previous Page 2

Displaying 21 – 30 of 30

Showing per page

Asynchronous sliding block maps

Marie-Pierre Béal, Olivier Carton (2000)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Asynchronous sliding block maps

Marie-Pierre Béal, Olivier Carton (2010)

RAIRO - Theoretical Informatics and Applications

We define a notion of asynchronous sliding block map that can be realized by transducers labeled in A* × 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 × Bk, 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...

Automate des préfixes-suffixes associé à une substitution primitive

Vincent Canterini, Anne Siegel (2001)

Journal de théorie des nombres de Bordeaux

On explicite une conjugaison en mesure entre le décalage sur le système dynamique associé à une substitution primitive et une transformation adique sur le support d'un sous-shift de type fini, à savoir l'ensemble des chemins d'un automate dit des préfixes-suffixes. En caractérisant les préimages par la conjugaison des chemins périodiques de l'automate, on montre que cette conjugaison est injective sauf sur un ensemble dénombrable, sur lequel elle est finie-à-un. On en déduit l'existence d'une suite...

Currently displaying 21 – 30 of 30

Previous Page 2