Completing biprefix codes
This short and well-written paper shows that each finite biprefix code can be extended to a recognizable maximal biprefix code. To obtain this result the author proves some other interesting facts for biprefix codes in terms of formal power series.
scientific article; zbMATH DE number 3848631