Regular universal codeword sets

Proof is given that no regular or synchronizable universal codeword sets can achieve optimality. Some asymptotic properties of a remarkable class of regular codeword sets related to the Fibonacci representation of integers are also obtained.

[1]  Leonidas J. Guibas,et al.  String Overlaps, Pattern Matching, and Nontransitive Games , 1981, J. Comb. Theory, Ser. A.

[2]  Michael Rodeh,et al.  Economical encoding of commas between strings , 1978, CACM.

[3]  Leonidas J. Guibas,et al.  Periods in Strings , 1981, J. Comb. Theory, Ser. A.

[4]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.

[5]  Peter Elias,et al.  Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.

[6]  Aldo de Luca.  On Some Properties of the Syntactic Semigroup of a Very Pure Subsemigroup , 1980, RAIRO Theor. Informatics Appl..

[7]  Andrew Chi-Chih Yao,et al.  An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..

[8]  Leo J. Guibas,et al.  Maximal Prefix-Synchronized Codes , 1978 .

[9]  William H. Kautz.  Fibonacci codes for synchronization control , 1965, IEEE Trans. Inf. Theory.

[10]  K. B. Lakshmanan.  On Universal Codeword Sets , 1981, IEEE Trans. Inf. Theory.

[11]  Edgar N. Gilbert,et al.  Synchronization of binary messages , 1960, IRE Trans. Inf. Theory.