Pages that link to "Item:Q3978864"
From MaRDI portal
The following pages link to Notes on Coding Problems for Finite State Processes (Q3978864):
Displaying 12 items.
- Mixing shifts of finite type with non-elementary surjective dimension representations (Q368697) (← links)
- Path methods for strong shift equivalence of positive matrices (Q368714) (← links)
- Constructing finitary isomorphisms with finite expected coding times (Q1860715) (← links)
- On absolutely continuous invariant measures and Krieger-type of Markov subshifts (Q2089918) (← links)
- (Q3137517) (← links)
- Linear algebra and subshifts of finite type (Q3317314) (← links)
- Almost isomorphism for countable state Markov shifts (Q3378474) (← links)
- An Extension Theorem for Closing Maps of Shifts of Finite Type (Q4038457) (← links)
- INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS (Q4162665) (← links)
- Flow equivalence of G-SFTs (Q5218246) (← links)
- The Coding of Internal States of Sequential Circuits (Q5335654) (← links)
- The mathematical research of William Parry FRS (Q5387235) (← links)