Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings

DOI10.1016/S0304-3975(98)00077-2zbMATH Open0912.68104OpenAlexW1981064965MaRDI QIDQ1275014FDOQ1275014

Authors: Birgit Reinert, Klaus Madlener 

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00077-2

Recommendations

• scientific article; zbMATH DE number 1241626
• scientific article; zbMATH DE number 1263328
• Reduction relations for monoid semirings
• Rewriting as a special case of non-commutative Gröbner basis theory

zbMATH Keywords

commutative monoidsstring rewriting systems[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis+methods&go=Go Gr��bner basis methods]

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Grammars and rewriting systems (68Q42)

Cites Work

• An introduction to commutative and noncommutative Gröbner bases
• Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-commutative Gröbner bases in algebras of solvable type
• Title not available (Why is that?)
• Title not available (Why is that?)
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Analogs of Gröbner bases in polynomial rings over a ring
• Title not available (Why is that?)
• An algorithm for constructing Gröbner and free Schreier bases in free group algebras
• Title not available (Why is that?)
• Word problems and a homological finiteness condition for monoids
• Title not available (Why is that?)
• Title not available (Why is that?)
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• A note on a special one-rule semi-Thue system
• Presentations of groups and monoids
• Title not available (Why is that?)
• A generalization of Gröbner basis algorithms to nilpotent group rings
• A generalization of Gröbner basis algorithms to polycyclic group rings
• On a special monoid with a single defining relation
• Undecidable questions related to Church-Rosser Thue systems
• Title not available (Why is that?)
• About the descriptive power of certain classes of finite string-rewriting systems
• Computing presentations for subgroups of polycyclic groups and of context-free groups
• Prefix-rewriting on context-free groups
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

• Reduction relations for monoid semirings
• Regular Gröbner bases
• NONCOMMUTATIVE GRÖBNER BASES FOR THE COMMUTATOR IDEAL
• Gröbner-Shirshov bases for some braid groups.
• Geometric intersections of loops on surfaces
• Free operated monoids and rewriting systems
• Weight ideals associated to regular and log-linear arrays.
• Gröbner bases of associative algebras and the Hochschild cohomology
• For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide
• The Mal'cev lemma and rewriting on semirings
• Gröbner basis cryptosystems
• Rewriting as a special case of non-commutative Gröbner basis theory
• Computing Gröbner bases by FGLM techniques in a non-commutative setting

This page was built for publication: Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings

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