Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups (Q1224177): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q124936987, #quickstatements; #temporary_batch_1711234560214 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of finite semigroups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The fundamental lemma of complexity for arbitrary finite semigroups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5628370 / rank | |||
Normal rank | |||
Latest revision as of 17:19, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups |
scientific article |
Statements
Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups (English)
0 references
1974
0 references
0 references
0 references
