AbstractWe construct a family of finite maximal codes over the alphabet {a,b} which verify the factorization conjecture on codes proposed by Schützenberger. This family contains any finite maximal code with at most three occurences of the letter b by word
Abstract. A palindrome is a symmetric string, phrase, number, or other sequence of units sequence th...
AbstractWe prove that if X is a finite code and s is an infinite word with 3 X-factorizations, then ...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
AbstractWe construct a family of finite maximal codes over the alphabet {a,b} which verify the facto...
AbstractWe give an algorithm constructing any finite maximal code over a two-letter alphabet A = {a,...
The algebraic theory of variable-length codes was initiated by Schützenberger in the 1950s. Almost a...
AbstractThe algebraic theory of variable-length codes was initiated by Schützenberger in the 1950s. ...
AbstractThis paper is the second part of a work dealing with two Schützenberger's conjectures on var...
RésuméNous construisons une famille de codes qui vérifiant la conjecture de factorisation de Schütze...
AbstractWe prove a noncommutative version of a theorem of Schützenberger on the factorization of var...
AbstractThe investigation of the factorizing codes C, i.e., codes satisfying Schützenberger's factor...
The investigation of the factorizing codes C, i.e., codes satisfying Schützenberger’s factorization ...
AbstractWe give a new characterization of some factorizations of finite cyclic groups described by H...
AbstractGiven a Hajós factorization of Zn, De Felice has shown that an + apb + baQ is finitely compl...
The canonical coding partition of a set of words is the finest partition such that the words contain...
Abstract. A palindrome is a symmetric string, phrase, number, or other sequence of units sequence th...
AbstractWe prove that if X is a finite code and s is an infinite word with 3 X-factorizations, then ...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
AbstractWe construct a family of finite maximal codes over the alphabet {a,b} which verify the facto...
AbstractWe give an algorithm constructing any finite maximal code over a two-letter alphabet A = {a,...
The algebraic theory of variable-length codes was initiated by Schützenberger in the 1950s. Almost a...
AbstractThe algebraic theory of variable-length codes was initiated by Schützenberger in the 1950s. ...
AbstractThis paper is the second part of a work dealing with two Schützenberger's conjectures on var...
RésuméNous construisons une famille de codes qui vérifiant la conjecture de factorisation de Schütze...
AbstractWe prove a noncommutative version of a theorem of Schützenberger on the factorization of var...
AbstractThe investigation of the factorizing codes C, i.e., codes satisfying Schützenberger's factor...
The investigation of the factorizing codes C, i.e., codes satisfying Schützenberger’s factorization ...
AbstractWe give a new characterization of some factorizations of finite cyclic groups described by H...
AbstractGiven a Hajós factorization of Zn, De Felice has shown that an + apb + baQ is finitely compl...
The canonical coding partition of a set of words is the finest partition such that the words contain...
Abstract. A palindrome is a symmetric string, phrase, number, or other sequence of units sequence th...
AbstractWe prove that if X is a finite code and s is an infinite word with 3 X-factorizations, then ...
International audienceWe define a code in a sofic shift as a set of blocks of symbols of the shift suc...
DOI
Add to ORKG