Finitely generated &ohgr;-languages
Information Processing Letters
Theoretical Computer Science
On generators of rational &ohgr;-power languages
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
Completion of recognizable bifix codes
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
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
Theoretical Computer Science - WORDS
A characterization of complete finite prefix codes in an arbitrary submonoid of A
Journal of Automata, Languages and Combinatorics
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Completing prefix codes in submonoids
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Completing a code in a regular submonoid of the free monoid
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Theoretical Computer Science
Hi-index | 5.23 |
Let M be an arbitrary submonoid of the free monoid A^*, and let X@?M be a variable length code (for short a code). X is weakly M-complete iff any word in M is a factor of some word in X^* [J. Neraud, C. Selmi, Free monoid theory: Maximality and completeness in arbitrary submonoids, Internat. J. Algebra Comput. 13 (5) (2003) 507-516]. Given a regular submonoid M, and given an arbitrary code X@?M, we are interested in the existence of a weakly M-complete code X@? that contains X. Actually, in [J. Neraud, Completing a code in a regular submonoid, in: Acts of MCU'2004, Lect. Notes Comput. Sci. 3354 (2005) 281-291; J. Neraud, Completing a code in a submonoid of finite rank, Fund. Inform. 74 (2006) 549-562], by presenting a general formula, we have established that, in any case, such a code X@? exists. In the present paper, we prove that any regular circular code X@?M may be embedded into a weakly M-complete one iff the minimal automaton with behavior M has a synchronizing word. As a consequence of our result an extension of the famous theorem of Schutzenberger is stated for regular circular codes in the framework of regular submonoids. We study also the behaviour of the subclass of uniformly synchronous codes in connection with these questions.