Variable-to-Fixed Length Codes and the Conservation of Entropy

For a large class of parsing rules, we introduce a "conservation of entropy" theorem for the output of unifilar Markov source. Using this theorem and renewal theory, we find a procedure to generate asymptotically optimal generalized variable-to-fixed length codes, unifilar Markov source.