DOIAbstract
AbstractA characterization of minimal complete sets of words of a free monoid which are codes, is given
AbstractA characterization of minimal complete sets of words of a free monoid which are codes, is given
AbstractLet M be an arbitrary submonoid of the free monoid A∗, and let X⊆M be a variable length code...
International audienceWe are interested in the concept of locally complete set : A subset X of the f...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. In this p...
AbstractA characterization of minimal complete sets of words of a free monoid which are codes, is gi...
AbstractLet M be a submonoid of the free monoid A*, and let X⊆M be a variable length code (for short...
International audienceWe explore several notions concerning codes and automata in a restricted set o...
International audienceWe explore several notions concerning codes and automata in a restricted set o...
Let $X^{*} $ be the free monoid generated by a finite alphabet $X$, where $|X|\geq 2 $. Every elemen...
It has been shown that in the free monoid X* generated by X with embedding order, any subset H of in...
The study of words as a mathematical object is a deep and rich field of study. Algebra, Combinatoric...
The notion of minimal codewords in linear codes was introduced recently by Massey. In this paper two...
AbstractWe show that, in a free partially abelian monoid generated by a finite alphabet A, the subse...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. In this p...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. In this p...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. In this p...
AbstractLet M be an arbitrary submonoid of the free monoid A∗, and let X⊆M be a variable length code...
International audienceWe are interested in the concept of locally complete set : A subset X of the f...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. In this p...
AbstractA characterization of minimal complete sets of words of a free monoid which are codes, is gi...
AbstractLet M be a submonoid of the free monoid A*, and let X⊆M be a variable length code (for short...
International audienceWe explore several notions concerning codes and automata in a restricted set o...
International audienceWe explore several notions concerning codes and automata in a restricted set o...
Let $X^{*} $ be the free monoid generated by a finite alphabet $X$, where $|X|\geq 2 $. Every elemen...
It has been shown that in the free monoid X* generated by X with embedding order, any subset H of in...
The study of words as a mathematical object is a deep and rich field of study. Algebra, Combinatoric...
The notion of minimal codewords in linear codes was introduced recently by Massey. In this paper two...
AbstractWe show that, in a free partially abelian monoid generated by a finite alphabet A, the subse...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. In this p...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. In this p...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. In this p...
AbstractLet M be an arbitrary submonoid of the free monoid A∗, and let X⊆M be a variable length code...
International audienceWe are interested in the concept of locally complete set : A subset X of the f...
International audienceLet A * denote the free monoid generated by a finite nonempty set A. In this p...
Add to ORKG