English

Computing degree and class degree

Dynamical Systems 2014-04-10 v1

Abstract

Let π\pi be a factor code from a one dimensional shift of finite type XX onto an irreducible sofic shift YY. If π\pi is finite-to-one then the number of preimages of a typical point in YY is an invariant called the degree of π\pi. In this paper we present an algorithm to compute this invariant. The generalized notion of the degree when π\pi is not limited to finite-to-one factor codes, is called the class degree of π\pi. The class degree of a code is defined to be the number of transition classes over a typical point of YY and is invariant under topological conjugacy. We show that the class degree is computable.

Keywords

Cite

@article{arxiv.1404.2530,
  title  = {Computing degree and class degree},
  author = {Mahsa Allahbakhshi},
  journal= {arXiv preprint arXiv:1404.2530},
  year   = {2014}
}

Comments

10 pages

R2 v1 2026-06-22T03:47:06.686Z