Free submonoids in the monoid of languages (Q1381858): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Yen-Shung Tsai / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Grigori I. Zhitomirski / rank | |||
Normal rank |
Revision as of 11:18, 21 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Free submonoids in the monoid of languages |
scientific article |
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