Free submonoids in the monoid of languages
Copyright policy )Free submonoids in the monoid of languages
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.
Prefix, length-variable, comma-free codes, languages, Free semigroups, generators and relations, word problems, Semigroups in automata theory, linguistics, etc., Discrete Mathematics and Combinatorics, monoids, free submonoids, Formal languages and automata, finite prefix codes, Theoretical Computer Science
Prefix, length-variable, comma-free codes, languages, Free semigroups, generators and relations, word problems, Semigroups in automata theory, linguistics, etc., Discrete Mathematics and Combinatorics, monoids, free submonoids, Formal languages and automata, finite prefix codes, Theoretical Computer Science
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!