Abstract : We study the relationship between codes and unambiguous automata inside a sofic system. We show that a recognizable set is a code in a sofic system if and only if a particular automaton associated to the set and the shift is unambiguous. We discuss an example of a finite complete code in a sofic system in connection with the factorization conjecture.
https://hal-upec-upem.archives-ouvertes.fr/hal-00619226
Contributor : Marie-Pierre Béal
<>
Submitted on : Monday, September 5, 2011 - 6:14:33 PM
Last modification on : Friday, April 12, 2019 - 10:18:03 AM
Long-term archiving on : Tuesday, December 6, 2011 - 2:28:46 AM
