 |
HAL UPEC - UPEM Portal |  |
 |
Journal articles
Codes, unambiguous automata and sofic systems
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.
Cited literature [12 references]
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 : Wednesday, February 26, 2020 - 7:06:05 PM
Long-term archiving on: : Tuesday, December 6, 2011 - 2:28:46 AM
Contributor : Marie-Pierre Béal <>
Submitted on : Monday, September 5, 2011 - 6:14:33 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Long-term archiving on: : Tuesday, December 6, 2011 - 2:28:46 AM
Files
hal.pdf
Files produced by the author(s)