Lossiness Of Communication Channels Modeled By Transducers

We provide an automata-theoretic approach to analyzing an abstract channel modeled by a transducer and to characterizing its lossy rates. In particular, we look at related decision problems and show the boundaries between the decidable and undecidable cases. We conduct experiments on several channels and use Lempel-Ziv algorithms to estimate lossy rates of these channels.