ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM (Q4645828): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The subpower membership problem for semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3848243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability and Learnability Arising from Algebras with Few Subpowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite set of functions with an EXPTIME-complete composition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE SUBPOWER MEMBERSHIP PROBLEM FOR MAL'CEV ALGEBRAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le produit de concatenation non ambigu / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of checking identities in 0-simple semigroups and matrix semigroups over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subpower membership problem for bands / rank
 
Normal rank

Latest revision as of 19:43, 17 July 2024

scientific article; zbMATH DE number 7000115
Language Label Description Also known as
English
ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM
scientific article; zbMATH DE number 7000115

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references