Completing a code in a regular submonoid of the free monoid

Abstract

Let M be a submonoid of the free monoid A*, and let X ⊂ M be a (variable length) code. X is weakly M-complete iff any word in M is a factor of some word in X* [NS 03]. In this paper, we are interested by an effective computation of a weakly M-complete code containing X. Given a regular submonoid and given a code X ⊂ M, we present a method of completion which preserves the regularity of X. © Springer-Verlag Berlin Heidelberg 2005.