Channels with asymptotically decreasing memory and anticipation

A definition for channels with asymptotically decreasing memory and anticipation is given. The relation to indecomposable finite-state channels and to a certain class of infinite-state channels is established. It is shown that for channels with asymptotically decreasing memory and anticipation every ergodic input source is admissible and that the coding theorem holds.