论文信息 - K-catenation and applications: k-prefix codes

K-catenation and applications: k-prefix codes

Abstract 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.

Lila Kari | Gabriel Thierrin | L. Kari | G. Thierrin

[1] Lila Kari,et al. On Language Equations with Invertible Operations , 1994, Theor. Comput. Sci..

[2] Gheorghe Paun,et al. Deletion Sets , 1993, Fundam. Informaticae.

[3] G. Thierrin,et al. Hypercodes, right convex languages and their syntactic monoids , 1981 .

[4] Peter C. Chapin. Formal languages I , 1973, CSC '73.

[5] Lila Kari,et al. Insertion operations: Closure properties , 1993, Bull. EATCS.

[6] J. Berstel,et al. Theory of codes , 1985 .

[7] Lila Kari,et al. On Insertion and Deletion in Formal Languages , 1991 .

[8] Masami Ito,et al. Outfix and Infix Codes and Related Classes of Languages , 1991, J. Comput. Syst. Sci..

[9] G. Lallement. Semigroups and combinatorial applications , 1979 .