Title of article
Free submonoids in the monoid of languages Original Research Article
Author/Authors
H.J. Shyr، نويسنده , , Y.S. Tsai، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
10
From page
213
To page
222
Abstract
The monoid of language M is the family of languages M = {A ¦0 ≠ ⊆ X+ or A = {1}}, where X+ is the free semigroup generated by the finite alphabet X containing more than one letter and l is the empty word. This paper is a study of free submonoids in M. We found a free submonoid of M which contains the family of all finite prefix codes.
Journal title
Discrete Mathematics
Serial Year
1998
Journal title
Discrete Mathematics
Record number
951404
Link To Document