
doi: 10.1007/pl00006011
For a given set \(X\), denote by \(G_X\) the set of finite directed trees whose edges are labelled by members of \(X\), with two distinguished vertices. In this note, using techniques of rewriting theory, a new proof is given of the theorem of Munn that the free inverse semigroup on \(X\) is isomorphic to a semigroup defined on the set of so-called birooted word trees on \(X\). The free inverse semigroup emerges as a quotient of \(G_X\) regarded as a certain algebra.
Free semigroups, generators and relations, word problems, free inverse semigroups, birooted word trees, finite directed trees, Inverse semigroups, Graphs and abstract algebra (groups, rings, fields, etc.)
Free semigroups, generators and relations, word problems, free inverse semigroups, birooted word trees, finite directed trees, Inverse semigroups, Graphs and abstract algebra (groups, rings, fields, etc.)
| selected citations These citations are derived from selected sources. 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). | 1 | |
| 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). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
