Free submonoids in the monoid of languages (Q1381858): Difference between revisions

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.