On the size of inverse semigroups given by generators
type: Item
instance of: scholarly article
title: On the size of inverse semigroups given by generators
zbMATH Open document ID: 1206.68168
author: Martin Beaudry
author: Markus Holzer
published in: Theoretical Computer Science
publication date: 2011-02-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5853809
zbMATH Keywords: inverse semigroups
zbMATH Keywords: finite automata
zbMATH Keywords: partial injective functions
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.11.021
OpenAlex ID: W2003815520
cites work: Inference of Reversible Languages
cites work: Q3848243
cites work: On deterministic finite automata and syntactic monoid size
cites work: Q4846425
cites work: STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
cites work: Sur l'ordre maximum d'un élément dans le groupe $S_n$ des permutations
cites work: Ordre maximal d'un élément du groupe $S_n$ des permutations et «highly composite numbers»
cites work: Q5840116
cites work: Q4714446
cites work: Q3265658
DOI: 10.1016/J.TCS.2010.11.021
Recommended article: Inverses of semigroup generators: a survey and remarks
Recommended article: Inverses of generators of nonanalytic semigroups
Recommended article: Inverses of generators of integrated or regularized semigroups
Recommended article: Q3689381
Recommended article: Generalised inverse semigroups with the smallest element
Recommended article: On the inverse of the generator of a bounded \(C_{0}\)-semigroup
Recommended article: Generalized inverse congruences on regular semigroups
Recommended article: A general theorem on inverse semigroups with finiteness conditions
Recommended article: Q4286316
Recommended article: Q4795404
description: scientific article; zbMATH DE number 5853809