Computing degree and class degree

preprint2014arXivOpen access

Abstract

Let ππ be a factor code from a one dimensional shift of finite type XX onto an irreducible sofic shift YY. If ππ is finite-to-one then the number of preimages of a typical point in YY is an invariant called the degree of ππ. In this paper we present an algorithm to compute this invariant. The generalized notion of the degree when ππ is not limited to finite-to-one factor codes, is called the class degree of ππ. 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.