Another semigroup of complexity \(n-1\)

DOI10.1007/BF02574269zbMath0737.20028OpenAlexW2045422658MaRDI QIDQ1176628

Andrew D. Foster

Publication date: 25 June 1992

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

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

zbMATH Keywords

complexitygeneratorsfree semilatticesemigroup of endomorphisms

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05)

Cites Work

• Finite binary relations have no more complexity than finite functions
• On the semigroup of binary relations

This page was built for publication: Another semigroup of complexity \(n-1\)