Finite Completion of comma-free codes Part 2
Published online by Cambridge University Press: 15 June 2004
This paper is a sequel to an earlier paper of the present author, in which it was proved that every finite comma-free code is embedded into a so-called (finite) canonical comma-free code. In this paper, it is proved that every (finite) canonical comma-free code is embedded into a finite maximal comma-free code, which thus achieves the conclusion that every finite comma-free code has finite completions.
- Research Article
- © EDP Sciences, 2004