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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have