| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438818 | Theoretical Computer Science | 2006 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
