Unambiguously coded systems

Dominique Perrin
IGM, Université Gustave Eiffel, Marne-la-Vallée

Date(s) : 15/06/2021   iCal
11 h 00 min - 12 h 00 min

We survey the notion of unambiguity for automata representing languages or shift spaces.  We relate this notion with that of recognizability for morphisms, as in Mossé’s Theorem. We focus on the case of coded systems introduced by Blanchard and Hansel. We state several results, including an unpublished one by Doris Fiebig: every coded system is unambiguously coded.
We describe several methods for computing an unambiguous representation of a synchronized coded system.



Site Sud, Luminy, TPR2, Salle de Séminaire 304-306 (3ème étage)


Retour en haut 

Secured By miniOrange