Codes, unambiguous automata and sofic systems
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. (c) 2006 Elsevier B.V. All rights reserved.
sofic shifts symbolic dynamics variable length codes