Free submonoids in the monoid of languages (Q1381858)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Free submonoids in the monoid of languages |
scientific article; zbMATH DE number 1135966
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Free submonoids in the monoid of languages |
scientific article; zbMATH DE number 1135966 |
Statements
Free submonoids in the monoid of languages (English)
0 references
24 August 1998
0 references
Let \(X\) be a finite alphabet. The authors use the term ``language'' only for nonempty subsets of \(X^*\setminus\{1\}\) and the set \(\{1\}\), where \(1\) is the empty word. For two languages \(A\) and \(B\), we have the language \(AB=\{xy\mid x\in A,\;y\in B\}\). So the monoid \(M\) of languages is obtained, and its free submonoids are studied. A free submonoid of \(M\) containing the family of all finite prefix codes is found.
0 references
monoids
0 references
languages
0 references
free submonoids
0 references
finite prefix codes
0 references
