Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood

Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger

We study the problem of deinterleaving a set of finite-memory (Markov) processes over disjoint finite alphabets, which have been randomly interleaved by a finite-memory switch. The…