The fundamental lemma of complexity for arbitrary finite semigroups (Q5577140): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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: Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homomorphism theorem for finite semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characters and complexity of finite semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for complexity of finite semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cascade synthesis of finite-state machines / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124858835 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1090/s0002-9904-1968-12064-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132100280 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:39, 30 July 2024

scientific article; zbMATH DE number 3294656
Language Label Description Also known as
English
The fundamental lemma of complexity for arbitrary finite semigroups
scientific article; zbMATH DE number 3294656

    Statements

    Identifiers