Zero-error capacity for models with memory and the enlightened dictator channel

We present a general class of zero-error capacity problems with memory covering known cases such as coding for error correction and many new cases. This class can be incorporated into a model of channels with memory, which thus are shown to give a unification of a multitude of seemingly very different coding problems. We analyze a seemingly basic channel in this class