A reduction theorem for complexity of finite semigroups (Q1216474): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: A generalization of the Rees theorem to a class of regular semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3848243 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite binary relations have no more complexity than finite functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Kernel systems - a global study of homomorphisms on finite semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5589352 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition and complexity of finite semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of finite semigroups / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1992030135 / rank | |||
Normal rank |
Latest revision as of 09:37, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A reduction theorem for complexity of finite semigroups |
scientific article |
Statements
A reduction theorem for complexity of finite semigroups (English)
0 references
1975
0 references