Notes on Coding Problems for Finite State Processes

DOI10.1112/BLMS/23.1.1zbMATH Open0808.28013OpenAlexW2079812735MaRDI QIDQ3978864FDOQ3978864

Authors: William Parry 

Publication date: 25 June 1992

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/blms/23.1.1

Recommendations

• Finitary Codes, a short survey
• scientific article; zbMATH DE number 2158947
• scientific article; zbMATH DE number 3979437
• The shift equivalence problem.
• Algebraic aspects of symbolic dynamics

zbMATH Keywords

topological conjugacyMarkov shiftsclassification of subshifts of finite type

Mathematics Subject Classification ID

Measure-preserving transformations (28D05) Entropy and other invariants (28D20) Low-dimensional dynamical systems (37E99) Ergodic theory of linear operators (47A35)

Cited In (14)

• Constructing finitary isomorphisms with finite expected coding times
• Path methods for strong shift equivalence of positive matrices
• Title not available (Why is that?)
• On absolutely continuous invariant measures and Krieger-type of Markov subshifts
• Linear algebra and subshifts of finite type
• The mathematical research of William Parry FRS
• Almost isomorphism for countable state Markov shifts
• An Extension Theorem for Closing Maps of Shifts of Finite Type
• INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS
• Flow equivalence of G-SFTs
• The Coding of Internal States of Sequential Circuits
• Mixing shifts of finite type with non-elementary surjective dimension representations
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Notes on Coding Problems for Finite State Processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978864)