pith. sign in

arxiv: 0812.1408 · v1 · pith:JA2APALWnew · submitted 2008-12-07 · 🧮 math.DS · math.OA

Reducibility of Covers of AFT shifts

classification 🧮 math.DS math.OA
keywords almostcoversfiniteshiftstypecoverirreduciblekrieger
0
0 comments X
read the original abstract

In this paper we show that the reducibility structure of several covers of sofic shifts is a flow invariant. In addition, we prove that for an irreducible subshift of almost finite type the left Krieger cover and the past set cover are reducible. We provide an example which shows that there are non almost finite type shifts which have reducible left Krieger covers. As an application we show that the Matsumoto algebra of an irreducible, strictly sofic shift of almost finite type is not simple.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.