ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS

DOI10.1142/S0218196799000187zbMath1029.20026OpenAlexW2006929850MaRDI QIDQ4513298

Jean-Camille Birget, John C. Meakin, Stuart W. Margolis

Publication date: 7 November 2000

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196799000187

zbMATH Keywords

Turing machinestensor productsfree products with amalgamationword problemfinitely presented monoidspushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06)

Related Items (8)

Amalgams of inverse semigroups and reversible two-counter machines. ⋮ A tribute to John Meakin on the occasion of his 75th birthday ⋮ Amalgams of free inverse semigroups. ⋮ On the decidability of the word problem for amalgamated free products of inverse semigroups. ⋮ Amalgams of finite inverse semigroups. ⋮ Algorithmic problems for amalgams of finite semigroups ⋮ PREGARSIDE MONOIDS AND GROUPS, PARABOLICITY, AMALGAMATION, AND FC PROPERTY ⋮ Normal forms for semigroup amalgams

Cites Work

• Absolutely flat semigroups
• The embedding of semigroup amalgams
• Free products with amalgamation of semigroups
• Free products with amalgamation of inverse semigroups
• Tensor products and computability
• Extension and Amalgamation in Monoids and Semigroups
• Time/Space Trade-Offs for Reversible Computation
• Embedding Theorems with Amalgamation for Semigroups^†
• REPRESENTATION EXTENSION AND AMALGAMATION FOR SEMIGROUPS

This page was built for publication: ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS