Add to ORKGInternational audienceGiven a rational set X, we investigate the set of uncompletable words in X*. These words cannot appear as factor of any word in X*. Some of them are called minimal uncompletable as soon as all their proper factors are factors of some words in X*. We study the deep structure of the set of minimal uncompletable words and then focus on the finite case
Communicated by D. Perrin A set of words over a finite alphabet is called an unavoidable set if ever...
International audienceA set of words X is called unavoidable on a given alphabet A if every infinite...
International audienceLet L(M) be the (factorial) language avoiding a given antifactorial language M...
International audienceA finite language X over an alphabet Σ is complete if any word in Σ* is a fact...
4 pagesLet S be a finite set of words over an alphabet Sigma. The set S is said to be complete if ev...
AbstractA set of words X over a finite alphabet A is said to be unavoidable if all but finitely many...
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...
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of ...
AbstractA word v is said to be a proper d-factor of a word u if v ≠ u and u = vx = yv for some words...
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...
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two...
We introduce the notion of a set of prohibitions and give definitions of a complete set and a crucia...
A finite set S of words over the alphabet ∑ is called non-complete if Fact(S*) ≠ ∑*. A word w ∈ ∑* \...
Communicated by D. Perrin A set of words over a finite alphabet is called an unavoidable set if ever...
International audienceA set of words X is called unavoidable on a given alphabet A if every infinite...
International audienceLet L(M) be the (factorial) language avoiding a given antifactorial language M...
International audienceA finite language X over an alphabet Σ is complete if any word in Σ* is a fact...
4 pagesLet S be a finite set of words over an alphabet Sigma. The set S is said to be complete if ev...
AbstractA set of words X over a finite alphabet A is said to be unavoidable if all but finitely many...
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...
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of ...
AbstractA word v is said to be a proper d-factor of a word u if v ≠ u and u = vx = yv for some words...
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...
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two...
We introduce the notion of a set of prohibitions and give definitions of a complete set and a crucia...
A finite set S of words over the alphabet ∑ is called non-complete if Fact(S*) ≠ ∑*. A word w ∈ ∑* \...
Communicated by D. Perrin A set of words over a finite alphabet is called an unavoidable set if ever...
International audienceA set of words X is called unavoidable on a given alphabet A if every infinite...
International audienceLet L(M) be the (factorial) language avoiding a given antifactorial language M...