Computing degree and class degree
From MaRDI portal
Abstract: Let be a factor code from a one dimensional shift of finite type onto an irreducible sofic shift . If is finite-to-one then the number of preimages of a typical point in 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 and is invariant under topological conjugacy. We show that the class degree is computable.
Recommendations
Cites work
- scientific article; zbMATH DE number 3139241 (Why is no real title available?)
- scientific article; zbMATH DE number 1984015 (Why is no real title available?)
- A Markovian Function of a Markov Chain
- An Introduction to Symbolic Dynamics and Coding
- An algorithm for sofic shift equivalence
- Class degree and relative maximal entropy
- Finite procedures for sofic systems
- Infinite-to-One Codes and Markov Measures
- Invariant measures of full dimension for some expanding maps
Cited in
(4)
This page was built for publication: Computing degree and class degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447767)