Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups (Q1224177): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0097-3165(74)90045-4
+Normal rank
@@ Property / OpenAlex ID @@
+W4235867836
@@ Property / OpenAlex ID: W4235867836 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q124936987
@@ Property / Wikidata QID: Q124936987 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
+Normal rank
@@ Property / cites work @@
+Complexity of finite semigroups
@@ Property / cites work: Complexity of finite semigroups / rank @@
+Normal rank
@@ Property / cites work @@
+The fundamental lemma of complexity for arbitrary finite semigroups
+Normal rank
@@ Property / cites work @@
+Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
+Normal rank
@@ Property / cites work @@
+Q5628370
@@ Property / cites work: Q5628370 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1224177