On finite-state information rates from channel simulations

It has recently become feasible to compute information rates of finite-state source/channel models with not too many states. In this paper, we apply such methods to finite-state approximations of channels that are not finite-state. In this way, an upper bound and a conjectured lower bound on the information rate of the actual channel can be computed.