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

DOI10.1016/S0304-3975(98)00077-2zbMath0912.68104OpenAlexW1981064965MaRDI QIDQ1275014

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

zbMATH Keywords

Gröbner basis methodscommutative monoidsstring rewriting systems

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)

Related Items

Reduction relations for monoid semirings ⋮ Geometric intersections of loops on surfaces ⋮ 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 ⋮ Gröbner basis cryptosystems ⋮ Gröbner-Shirshov bases for some braid groups. ⋮ The Mal'cev lemma and rewriting on semirings ⋮ Weight ideals associated to regular and log-linear arrays. ⋮ NONCOMMUTATIVE GRÖBNER BASES FOR THE COMMUTATOR IDEAL ⋮ Computing Gröbner bases by FGLM techniques in a non-commutative setting ⋮ Regular Gröbner bases

Cites Work

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