AbstractEhrenfeucht's Conjecture states that each subset S of a finitely generated free monoid has a finite subset T such that if two endomorphisms of the monoid agree on T, then they agree on S. It is the purpose of this note to verify the conjecture
AbstractA subset X of a free monoid A∗ is said to be unavoidable if all but finitely many words in A...
AbstractWe prove that if x0u1ix1u2ix2 = y0v1iy1v2iy2 holds for all i ϵ {0, 1, 2, 3}, then it is true...
AbstractA complete class of generators for Straubing's dot-depth k monoids has been characterized as...
AbstractEhrenfeucht's conjecture states that every language L has a finite subset F such that, for a...
AbstractEhrenfeucht's conjecture states that every language L has a finite subset F such that, for a...
AbstractWe survey recent results on the so-called Ehrenfeucht Conjecture which states: For each lang...
AbstractEhrenfeucht's Conjecture, that each subset S of a finitely generated free monoid has a finit...
AbstractWe will show that some variants of the Ehrenfeucht Conjecture give us algebraic properties w...
AbstractWe describe an algebraic framework including, in particular, the affine monoid of a given ri...
AbstractEhrenfeucht's Conjecture, that each subset S of a finitely generated free monoid has a finit...
AbstractIt is proved to be decidable, for any given finite subset F of X∗ and mapping ϕ:F→X∗, whethe...
It is shown that for every context free language L there effectively exists a test set F, that is, a...
An alternative definition is given for a family of subsets of a free monoid that has been considered...
AbstractSeveral observations concerning equations over monoids of finite sets of words are made. Mon...
We first show that arithmetic is bi-interpretable (with parameters) with the free monoid and with pa...
AbstractA subset X of a free monoid A∗ is said to be unavoidable if all but finitely many words in A...
AbstractWe prove that if x0u1ix1u2ix2 = y0v1iy1v2iy2 holds for all i ϵ {0, 1, 2, 3}, then it is true...
AbstractA complete class of generators for Straubing's dot-depth k monoids has been characterized as...
AbstractEhrenfeucht's conjecture states that every language L has a finite subset F such that, for a...
AbstractEhrenfeucht's conjecture states that every language L has a finite subset F such that, for a...
AbstractWe survey recent results on the so-called Ehrenfeucht Conjecture which states: For each lang...
AbstractEhrenfeucht's Conjecture, that each subset S of a finitely generated free monoid has a finit...
AbstractWe will show that some variants of the Ehrenfeucht Conjecture give us algebraic properties w...
AbstractWe describe an algebraic framework including, in particular, the affine monoid of a given ri...
AbstractEhrenfeucht's Conjecture, that each subset S of a finitely generated free monoid has a finit...
AbstractIt is proved to be decidable, for any given finite subset F of X∗ and mapping ϕ:F→X∗, whethe...
It is shown that for every context free language L there effectively exists a test set F, that is, a...
An alternative definition is given for a family of subsets of a free monoid that has been considered...
AbstractSeveral observations concerning equations over monoids of finite sets of words are made. Mon...
We first show that arithmetic is bi-interpretable (with parameters) with the free monoid and with pa...
AbstractA subset X of a free monoid A∗ is said to be unavoidable if all but finitely many words in A...
AbstractWe prove that if x0u1ix1u2ix2 = y0v1iy1v2iy2 holds for all i ϵ {0, 1, 2, 3}, then it is true...
AbstractA complete class of generators for Straubing's dot-depth k monoids has been characterized as...
DOI
Add to ORKG