On the size of inverse semigroups given by generators
From MaRDI portal
Publication:627176
DOI10.1016/j.tcs.2010.11.021zbMath1206.68168MaRDI QIDQ627176
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
68Q45: Formal languages and automata
Related Items
Cites Work
- 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»
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item