  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.
