Results 241 to 249 of about 7,864,333 (249)
Some of the next articles are maybe not open access.
On the factorization conjecture
1992We construct a family of finite maximal codes over the alphabet {a, b} which verify the factorization conjecture on codes proposed by Schutzenberger. This family contains any finite maximal code with at most three occurrences of the letter b by word.
openaire +2 more sources
In this paper we introduce the notion of generalized factorization for an arbitrary submonoid M subset of A*, where A* is the free monoid generated by an alphabet A, generalizing, in this way, the notion of factorization of A*. Then we give a characterization of the free product of two submonoids of A* in terms of unambiguous products of monoids. To do
openaire +1 more source
openaire +1 more source