Elsevier

Theoretical Computer Science

Volume 136, Issue 2, 26 December 1994, Pages 471-485
Theoretical Computer Science

Congruences, infix and cohesive prefix codes

https://doi.org/10.1016/0304-3975(94)00018-EGet rights and content
Under an Elsevier user license
open archive

Abstract

A language LX* is called cohesive prefix code if xLyL ≠ ∅ implies that y = 1 and xLL for any x, yϵX*. An example of cohesive prefix codes is an infix code. We determine first the structure of cohesive prefix codes and then we study several relationships between maximal infix codes and maximal cohesive prefix codes. Finally, we determine the structure of a cohesive prefix code that is a right semaphore code.

Cited by (0)

This work was supported by Grant-in-Aid for Scientific Research 04044150, Ministry of Education, Science and Culture of Japan and the Natural Science and Engineering Research Council of Canada Grant A7877.