Completing comma-free codes

  • Authors:

  • Nguyen Huong Lam

  • Affiliations:

  • Hanoi Institute of Mathematics, P.O. Box 631, Bo Ho, 10 000 Hanoi, Viet Nam

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 5.23

Visualization

Abstract

We prove that for every regular comma-free code there exists a maximal comma-free code containing it which is still regular and, moreover, we can effectively locate such a completion. In particular, we can decide whether a given regular comma-free code is maximal.