Sandwich semigroups of binary relations
Copyright policy )Sandwich semigroups of binary relations
AbstractThis paper introduces new semigroups of binary relations that arose naturally from investigating the transfer of information between automata and semigroups associated with automata. In particular we introduce a new multiplication on binary relations by means of an arbitrary but fixed “sandwich” relation. R.J. Plemmons and M. West have characterized Green's relations in the usual semigroup of binary relations, and we use these to investigate Green's relations in our semigroups. We give algorithms for constructing idempotents and regular elements in these new semigroups.
- Oklahoma City University United States
Semigroups of transformations, relations, partitions, etc., regular elements, Other classical set theory (including functions, relations, and set algebra), idempotents, Discrete Mathematics and Combinatorics, semigroups of binary relations, Theoretical Computer Science
Semigroups of transformations, relations, partitions, etc., regular elements, Other classical set theory (including functions, relations, and set algebra), idempotents, Discrete Mathematics and Combinatorics, semigroups of binary relations, 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).16 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!