๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Sandwich semigroups of binary relations

โœ Scribed by Karen Chase

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
578 KB
Volume
28
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

This 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.

๐Ÿ“œ SIMILAR VOLUMES

Semigroups of tolerance relations
Semigroups of tolerance relations
โœ Boris M. Schein ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 673 KB

algebraic characterization of semigroups of tolerance relations and semigroups of symmetric binary relations. Clearly, Mpo = MoMo, where Mp, Mo and Mpo are the 0, 1-matrices corresponding to p, o, and po, and the product of matrices is the Boolean one (i.e., 1 + 1 = 1). If p is a binary relation, t

Intervals of Binary Relations
Intervals of Binary Relations
โœ David W. H. Gillam ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 284 KB