Elsevier

Discrete Mathematics

Volume 181, Issues 1–3, 15 February 1998, Pages 213-222
Discrete Mathematics

Free submonoids in the monoid of languages

https://doi.org/10.1016/S0012-365X(97)00037-XGet rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)

This research was supported by the National Science Council R.O.C. under Grant NSC83-0208-M005-023.