On the size of inverse semigroups given by generators

DOI10.1016/J.TCS.2010.11.021zbMath1206.68168OpenAlexW2003815520MaRDI QIDQ627176

Martin Beaudry, Markus Holzer

Publication date: 21 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.021

zbMATH Keywords

inverse semigroupsfinite automatapartial injective functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Descriptional complexity of regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On deterministic finite automata and syntactic monoid size
• Inference of Reversible Languages
• STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
• Sur l'ordre maximum d'un élément dans le groupe $S_n$ des permutations
• Ordre maximal d'un élément du groupe $S_n$ des permutations et «highly composite numbers»

This page was built for publication: On the size of inverse semigroups given by generators