论文信息 - Finite DOL Languages and Codes

Finite DOL Languages and Codes

Abstract A finite DOL language that does not contain the null string is either a prefix code or a suffix code. When the null string is removed from a finite DOL language that contains the null string a code remains.

Tom Head | John Wilkinson

[1] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .

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

[3] Tom Head,et al. DOL Schemes and the Periodicity of String Embeddings , 1983, Theor. Comput. Sci..

[4] Paul M. B. Vitányi,et al. On the Size of D0L Languages , 1974, L Systems.