Green's equivalences in finite semigroups of binary relations

DOI10.1007/BF02573672zbMath0805.20059MaRDI QIDQ1318965

Janusz Konieczny

Publication date: 8 February 1995

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/135314

zbMATH Keywords

algorithmsGreen's relationssemigroups of binary relationscomplete frames of \(\mathcal D\)-classes

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Mappings of semigroups (20M15)

Related Items (3)

Green's classifications and evolutions of fixed-order networks ⋮ Computing finite semigroups ⋮ On relative ranks of full transformation semigroups

Uses Software

• AUTOMATE

Cites Work

• Une représentation fidele des groupes d'un monoide de rélations binaires sur un ensemble fini
• On the determination of Green's relations in finite transformation semigroups
• AUTOMATE, a computing package for automata and finite semigroups
• On generating regular elements in the semigroup of binary relations
• On the semigroup of binary relations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Green's equivalences in finite semigroups of binary relations