Two variants of the Froidure-Pin algorithm for finite semigroups

DOI10.4171/PM/2001zbMath1421.20020arXiv1704.04084OpenAlexW2962922377WikidataQ57990346 ScholiaQ57990346MaRDI QIDQ2413194

James D. Mitchell, Julius Jonušas, Markus Pfeiffer

Publication date: 9 April 2018

Published in: Portugaliae Mathematica. Nova Série (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.04084

zbMATH Keywords

algorithmsGreen's relationssemigroupsmonoids

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (2)

Computing maximal subsemigroups of a finite semigroup ⋮ Random ubiquitous transformation semigroups

This page was built for publication: Two variants of the Froidure-Pin algorithm for finite semigroups