Finitely generated &ohgr;-languages
Information Processing Letters
Theoretical Computer Science
On generators of rational &ohgr;-power languages
Theoretical Computer Science
On synchronizing unambiguous automata
Theoretical Computer Science
Finitely generated sofic systems
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Prefix-free languages as &ohgr;-generators
Information Processing Letters
On completion of codes with finite deciphering delay
European Journal of Combinatorics
Finitely generated bi &lgr;-languages
Theoretical Computer Science
On maximal codes with bounded synchronization delay
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
On codes with a finite deciphering delay: constructing uncompletable words
Theoretical Computer Science
Theoretical Computer Science
On maximal codes with a finite interpreting delay
Theoretical Computer Science
Locally complete sets and finite decomposable codes
Theoretical Computer Science
Theory of Codes
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Image reducing words and subgroups of free groups
Theoretical Computer Science - WORDS
A characterization of complete finite prefix codes in an arbitrary submonoid of A
Journal of Automata, Languages and Combinatorics
Completing a code in a regular submonoid of the free monoid
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Hi-index | 0.00 |
Let M be a submonoid of the free monoid A*, and let X⊂M be a variable length code (for short a code). X is weakly M-complete if and only if any word in M is a factor of some word in X* (cf [20]). In this paper, which is the full version of a result presented in [17], we are interested by an effective computation of a weakly M-complete code containing X, namely &Xcirc;⊂M. In this framework, we consider the class of submonoids M of A* which have finite rank. We define the rank of M as the rank of the minimal automaton with behavior M, i.e. the smallest positive integer r such that a word w satisfies ∣Q·w∣=r, where Q stands for the set of states (the action of the word w may be not defined on some state in Q). Regular submonoids are the most typical example of submonoids with finite rank. Given a submonoid with finite rank M⊂A*, and given a code X⊂M, we present a method of completion which makes only use of regular or boolean operations on sets. As a consequence, if M and X are regular sets then so is &Xcirc;.