Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
type: Item
instance of: scholarly article
title: Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
zbMATH Open document ID: 0323.20069
DOI: 10.1016/0097-3165(74)90045-4
author: K. Appert
published in: Journal of Combinatorial Theory. Series A
publication date: 1974-01-01T00:00:00Z
Mathematics Subject Classification ID: 20M30
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3505276
MaRDI profile type: Publication
full work available at URL: 0097-3165(74)90045-4
OpenAlex ID: W4235867836
Wikidata QID: Q124936987
cites work: Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
cites work: Complexity of finite semigroups
cites work: The fundamental lemma of complexity for arbitrary finite semigroups
cites work: Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
cites work: Q5628370
description: scientific article; zbMATH DE number 3505276