K-catenation and applications:k-prefix codes
Lila Kari, G. Thierrin · Journal of Information and Optimization Sciences · 1995
Some generalizations of the usual operations of catenation and quotient of languages are introduced and studied. In particular, language equations involving these operations are considered. Infinite hierarchies of classes of prefix codes and classes of equivalence relations are defined and investigated in connection respectively with the classical notions of prefix codes and right syntactic congruences.