On the size of inverse semigroups given by generators (Q627176): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.11.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2003815520
@@ Property / OpenAlex ID: W2003815520 / rank @@
+Normal rank
@@ Property / cites work @@
+Inference of Reversible Languages
@@ Property / cites work: Inference of Reversible Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3848243
@@ Property / cites work: Q3848243 / rank @@
+Normal rank
@@ Property / cites work @@
+On deterministic finite automata and syntactic monoid size
+Normal rank
@@ Property / cites work @@
+Q4846425
@@ Property / cites work: Q4846425 / rank @@
+Normal rank
@@ Property / cites work @@
+STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
+Normal rank
@@ Property / cites work @@
+Sur l'ordre maximum d'un élément dans le groupe $S_n$ des permutations
+Normal rank
@@ Property / cites work @@
+Ordre maximal d'un élément du groupe $S_n$ des permutations et «highly composite numbers»
+Normal rank
@@ Property / cites work @@
+Q5840116
@@ Property / cites work: Q5840116 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3265658
@@ Property / cites work: Q3265658 / rank @@
+Normal rank