Partial words were introduced by Berstel and Boasson in 1999. Since then various of their combinatorial properties have been studied, the foremost being periodicity. Lately Blanchet-Sadri has made a first step in also investigating languages of partial words by introducing the concept of pcodes. With a slightly different approach we define new ways to obtain such languages by puncturing conventional ones. Then we present some first results on properties like the finiteness of their root or the property of being a code for these newly defined punctured languages.
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
AbstractCodes play an important role in the study of the combinatorics of words. In this paper, we i...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet, also...
AbstractThe concept of periodicity has played over the years a central role in the development of co...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet (also...
AbstractPrimitive words, or strings over a finite alphabet that cannot be written as a power of anot...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet (also...
AbstractA partial word is a word that is a partial mapping into an alphabet. We prove a variant of F...
AbstractA word of length n over a finite alphabet A is a map from {0,…,n−1} into A. A partial word o...
AbstractThe study of combinatorics on words, or finite sequences of symbols from a finite alphabet, ...
Codes play an important role in the study of the combinatorics of words. In this paper, we introduce...
Combinatorics on words, or sequences or strings of symbols over a finite al-phabet, is a rather new ...
AbstractA partial word of length n over a finite alphabet A is a partial map from {0,…, n − 1} into ...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
AbstractCodes play an important role in the study of the combinatorics of words. In this paper, we i...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet, also...
AbstractThe concept of periodicity has played over the years a central role in the development of co...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet (also...
AbstractPrimitive words, or strings over a finite alphabet that cannot be written as a power of anot...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet (also...
AbstractA partial word is a word that is a partial mapping into an alphabet. We prove a variant of F...
AbstractA word of length n over a finite alphabet A is a map from {0,…,n−1} into A. A partial word o...
AbstractThe study of combinatorics on words, or finite sequences of symbols from a finite alphabet, ...
Codes play an important role in the study of the combinatorics of words. In this paper, we introduce...
Combinatorics on words, or sequences or strings of symbols over a finite al-phabet, is a rather new ...
AbstractA partial word of length n over a finite alphabet A is a partial map from {0,…, n − 1} into ...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...
The notion of an unavoidable set of words appears frequently in the fields of mathematics and theore...