Codes, unambiguous automata and sofic systems

详细信息    查看全文

• 作者：Marie-Pierre Bé ; al and Dominique Perrin
• 关键词：Sofic shifts ; Symbolic dynamics ; Variable length codes
• 刊名：Theoretical Computer Science
• 出版年：2006
• 出版时间：5 May 2006
• 年：2006
• 卷：356
• 期：1-2
• 页码：6-13
• 全文大小：179 K

文摘

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.