ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS (Q4513298): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Tensor products and computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time/Space Trade-Offs for Reversible Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolutely flat semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The embedding of semigroup amalgams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free products with amalgamation of semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free products with amalgamation of inverse semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: REPRESENTATION EXTENSION AND AMALGAMATION FOR SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Theorems with Amalgamation for Semigroups<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension and Amalgamation in Monoids and Semigroups / rank
 
Normal rank

Revision as of 17:18, 30 May 2024

scientific article; zbMATH DE number 1526896
Language Label Description Also known as
English
ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS
scientific article; zbMATH DE number 1526896

    Statements

    ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS (English)
    0 references
    7 November 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    word problem
    0 references
    free products with amalgamation
    0 references
    finitely presented monoids
    0 references
    tensor products
    0 references
    Turing machines
    0 references
    pushdown automata
    0 references
    0 references
    0 references
    0 references