On the decoding delay of encoders for input-constrained channels

We show that checking whether there is a finite state encoder having local anticipation t encoding n-ary data into a constrained system S is a decidable problem. We also show that if there is such an encoder, then a version of the state-splitting algorithm can be applied to produce a finite state encoder having local anticipation at most 2t.