Completing comma-free codes
โ
Nguyen Huong Lam
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 248 KB
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 e ectively locate such a completion. In particular, we can decide whether a given regular comma-free code is maximal.