AbstractThis paper proves that a 3-infix-outfix code is a maximal code if and only if it is a group code, or equivalently, if and only if, it is a full uniform code. Thus, the structure for 3-infix—outfix code being a maximal code can be completely determined
AbstractA characterization of minimal complete sets of words of a free monoid which are codes, is gi...
In recent years codes that are not Uniquely Decipherable (UD) have been studied partitioning them in...
AbstractWe construct a family of finite maximal codes over the alphabet {a,b} which verify the facto...
AbstractThis paper proves that a 3-infix-outfix code is a maximal code if and only if it is a group ...
AbstractA language L such that no word in L is a proper factor of another word in L is said to be an...
AbstractThe proposition “For composable thin codes Y and Z, the composition Y∘Z is maximal if and on...
AbstractSome results are given on maximal monoids in the language of the soficsystem generated by a ...
It has been shown that in the free monoid X* generated by X with embedding order, any subset H of in...
A necessary and sufficient condition is given under which a finite prefix code A (A ⊆ X*) is maximal...
AbstractIn this paper, we study the decompositions of recognizable strong maximal codes and obtain t...
AbstractSolid codes, a special class of bifix codes, were introduced recently in the connection with...
AbstractWe give an algorithm constructing any finite maximal code over a two-letter alphabet A = {a,...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
AbstractIn this paper, we are concerned with finite p-s-composed codes, that is with codes obtained ...
AbstractA characterization of minimal complete sets of words of a free monoid which are codes, is gi...
In recent years codes that are not Uniquely Decipherable (UD) have been studied partitioning them in...
AbstractWe construct a family of finite maximal codes over the alphabet {a,b} which verify the facto...
AbstractThis paper proves that a 3-infix-outfix code is a maximal code if and only if it is a group ...
AbstractA language L such that no word in L is a proper factor of another word in L is said to be an...
AbstractThe proposition “For composable thin codes Y and Z, the composition Y∘Z is maximal if and on...
AbstractSome results are given on maximal monoids in the language of the soficsystem generated by a ...
It has been shown that in the free monoid X* generated by X with embedding order, any subset H of in...
A necessary and sufficient condition is given under which a finite prefix code A (A ⊆ X*) is maximal...
AbstractIn this paper, we study the decompositions of recognizable strong maximal codes and obtain t...
AbstractSolid codes, a special class of bifix codes, were introduced recently in the connection with...
AbstractWe give an algorithm constructing any finite maximal code over a two-letter alphabet A = {a,...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
AbstractIn this paper, we are concerned with finite p-s-composed codes, that is with codes obtained ...
AbstractA characterization of minimal complete sets of words of a free monoid which are codes, is gi...
In recent years codes that are not Uniquely Decipherable (UD) have been studied partitioning them in...
AbstractWe construct a family of finite maximal codes over the alphabet {a,b} which verify the facto...
DOI
Add to ORKG