On the retracts and recodings of continuing codes
Bull. Korean Math. Soc. 2015 Vol. 52, No. 4, 1375-1382
https://doi.org/10.4134/BKMS.2015.52.4.1375
Published online July 31, 2015
Jisang Yoo
Ajou University
Abstract : We investigate what happens when we try to work with continuing block codes (i.e., left or right continuing factor maps) between shift spaces that may not be shifts of finite type. For example, we demonstrate that continuing block codes on strictly sofic shifts do not behave as well as those on shifts of finite type; a continuing block code on a sofic shift need not have a uniformly bounded retract, unlike one on a shift of finite type. A right eresolving code on a sofic shift can display any behavior arbitrary block codes can have. We also show that a right continuing factor of a shift of finite type is always a shift of finite type.
Keywords : eresolving, right continuing code, infinite-to-one code, SFT, factor map
MSC numbers : Primary 37B10
Downloads: Full-text PDF  


Copyright © Korean Mathematical Society. All Rights Reserved.
The Korea Science Technology Center (Rm. 411), 22, Teheran-ro 7-gil, Gangnam-gu, Seoul 06130, Korea
Tel: 82-2-565-0361  | Fax: 82-2-565-0364  | E-mail: paper@kms.or.kr   | Powered by INFOrang Co., Ltd