论文信息 - Multiplicities of covers for sofic shifts

Multiplicities of covers for sofic shifts

We consider a transitive sofic shift T and a SFT cover f:S→T. We define the multiplicity of the cover (S,f) to be the largest number of preimages of a point. The intrinsic multiplicity of T is the minimum of the multiplicities over all covers of T, denoted by m(T). Is m(T) computable? We do not answer this question. However the attempt to solve this problem led us to find sharp estimates for the intrinsic multiplicity, sharpen a result of Williams, and solve a problem posed by Trow.

Natasa Jonoska | Doris Fiebig | Ulf-Rainer Fiebig

[1] A sofic system with infinitely many minimal covers , 1986 .

[2] Lifting covers of sofic shifts , 1998 .

[3] Mike Boyle. Factoring Factor Maps , 1998 .

[4] Mike Boyle,et al. A note on minimal covers for sofic systems , 1985 .

[5] Natasa Jonoska. Sofic Shifts with Synchronizing Presentations , 1996, Theor. Comput. Sci..