Compact factors of countable state Markov shifts

We study continuous shift commuting maps from transitive countable state Markov shifts into compact subshifts. The closure of the image is a coded system. On the other hand, any coded system is the surjective image of some transitive Markov shift, which may be chosen locally compact by construction....

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2002-01, Vol.270 (1), p.935-946
Main Authors: Fiebig, Doris, Fiebig, Ulf-Rainer
Format: Article
Language:English
Subjects:
Coded system
Markov shift
Synchronized system
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study continuous shift commuting maps from transitive countable state Markov shifts into compact subshifts. The closure of the image is a coded system. On the other hand, any coded system is the surjective image of some transitive Markov shift, which may be chosen locally compact by construction. These two results yield a formal analogy to “the transitive sofic systems are the subshift factors of transitive shifts of finite type”. Then we consider factor maps which have bounded coding length in some graph presentation (label maps). Now the image has to be synchronized, but not every synchronized system can be obtained in this way. We show various restrictions for a surjective label map to exist.
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(01)00105-0