Free products with amalgamation of monoids

DOI10.1016/S0022-4049(96)00145-4MaRDI QIDQ1380048zbMATH OpenWikidataFDO

Authors Deko V. Dekov

Publication date 9 September 1998

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0022-4049(96)00145-4

zbMATH Keywords

free products with amalgamationgroupsmonoidsstring rewriting

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42)

Review text

A theorem of Bourbaki on free products with amalgamation of monoids is reproved here using techniques from string rewriting; it is based on a method due to \textit{T. Evans} [in Word problems II, Stud. Logic Found. Math. 95, 87-100 (1980; Zbl 0432.08004)]. The main application of this theorem is to establish Schreier's result on free products with amalgamation of groups.

Recommendations

• scientific article; zbMATH DE number 4025685
• An elementary treatment of the construction of the free product of groups.
• Free operated monoids and rewriting systems
• Complete rewriting system for the Schützenberger product of n groups
• scientific article; zbMATH DE number 475444

Cites work

• Amalgamated Products of Semigroups: The Embedding Problem
• An essay on free products of groups with amalgamations
• scientific article; zbMATH DE number 3153997 (Why is no real title available?)
• scientific article; zbMATH DE number 3672369 (Why is no real title available?)
• scientific article; zbMATH DE number 3575812 (Why is no real title available?)
• scientific article; zbMATH DE number 475444 (Why is no real title available?)
• scientific article; zbMATH DE number 794238 (Why is no real title available?)
• scientific article; zbMATH DE number 3334182 (Why is no real title available?)
• New decision algorithms for finitely presented commutative semigroups
• On theories with a combinatorial definition of 'equivalence'
• Systems of reductions

Cited in

(15)

• Free products with amalgamation of semigroups
• The free product is not associative
• Free operated monoids and rewriting systems
• Cyclic amalgams, HNN extensions, and Garside one-relator groups
• An elementary treatment of the construction of the free product of groups.
• Free Product with Amalgamation and Free Actions on R -Trees
• scientific article; zbMATH DE number 5320041 (Why is no real title available?)
• THE FREE AMPLE MONOID
• scientific article; zbMATH DE number 4025685 (Why is no real title available?)
• scientific article; zbMATH DE number 3557867 (Why is no real title available?)
• Some applications of freeness with amalgamation
• Schützenberger-like products in non-free monoids
• Automata with counters that recognize word problems of free products
• A correspondence between a class of monoids and self-similar group actions II
• Free wreath products with amalgamation

This page was built for publication: Free products with amalgamation of monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380048)