A note on homomorphisms of a free monoid.
C.M. Reis (1978)
Semigroup forum
Similarity:
Displaying similar documents to “Some Free Submonoids of the Free Monoid of Prefix Codes.”
A note on homomorphisms of a free monoid.
The intersection of free submonoids of a free monoid is free.
B. Tilson (1972)
Semigroup forum
Similarity:
Semisimplicity of the algebra associated to a biprefix code.
C. Reutenauer (1981)
Semigroup forum
Similarity:
A note on intersections of free submonoids of a free monoid.
J. Karhumäki (1984)
Semigroup forum
Similarity:
When is a functionally free algebra free?
T. Evans (1972)
Semigroup forum
Similarity:
Note on compatible well orders on a free monoid.
Y. Kobayashi (1992)
Semigroup forum
Similarity:
A theorem on free envelopes.
Chester, jr. John (1974)
Semigroup forum
Similarity:
Homomorphisms of free contents.
J. Shafer (1974)
Semigroup forum
Similarity:
Compatibility relations on codes and free monoids
Tomi Kärki (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
A compatibility relation on letters induces a reflexive and symmetric relation on words of equal length. We consider these word relations with respect to the theory of variable length codes and free monoids. We define an -code and an -free monoid for arbitrary word relations and . Modified Sardinas-Patterson algorithm is presented for testing whether finite sets of words are -codes. Coding capabilities of relational codes are measured algorithmically by finding minimal and maximal relations....
Limited semaphore codes.
M. Satyanarayana, S. Mohanty (1992)
Semigroup forum
Similarity: