Finitely Generated Sofic Systems

Abstract We prove that is decidable whether a transitive sofic system is finitely generated.

[1]  J. Berstel,et al.  Theory of codes , 1985 .

[2]  Antonio Restivo.  Codes and Local Constraints , 1990, Theor. Comput. Sci..

[3]  Dominique Perrin,et al.  Une caractérisation des ensembles sofiques , 1986 .

[4]  B. Weiss.  Subshifts of finite type and sofic systems , 1973 .

[5]  Brian H. Marcus,et al.  Sofic systems and encoding data , 1985, IEEE Trans. Inf. Theory.

[6]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[7]  F Blanchard,et al.  Coded systems , 1986 .

[8]  Marie-Pierre Béal,et al.  Codage, automates locaux et entropie , 1987 .