FINITENESS CONDITIONS FOR REWRITING SYSTEMS
From MaRDI portal
Publication:4680589
DOI10.1142/S0218196705002074zbMath1102.68046MaRDI QIDQ4680589
Stuart McGlashan, Elton Pasku, Stephen J. Pride
Publication date: 7 June 2005
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Free semigroups, generators and relations, word problems (20M05) Topological methods in group theory (57M07) Grammars and rewriting systems (68Q42) Connections of semigroups with homological algebra and category theory (20M50)
Related Items (5)
Higher-dimensional normalisation strategies for acyclicity ⋮ On some homotopical and homological properties of monoid presentations. ⋮ On higher order homological finiteness of rewriting systems. ⋮ Semigroups with finitely generated universal left congruence ⋮ Polygraphs of finite derivation type
Cites Work
- Unnamed Item
- Unnamed Item
- For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
- Word problems and a homological finiteness condition for monoids
- Homotopy reduction systems for monoid presentations
- A finiteness condition for rewriting systems
- Finite derivation type implies the homological finiteness condition \(FP_ 3\)
- For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- Homological Finite Derivation Type
- A Monoid which is Right FP ∞ but not Left FP 1
- RELATION MODULES AND RELATION BIMODULES OF GROUPS, SEMIGROUPS AND ASSOCIATIVE ALGEBRAS
- Low dimensional homotopy for monoids II: groups
- On the Algebra of Semigroup Diagrams
- ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS
- SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID
- FOR REWRITING SYSTEMS THE TOPOLOGICAL FINITENESS CONDITIONS FDT AND FHT ARE NOT EQUIVALENT
- LOW-DIMENSIONAL HOMOTOPY THEORY FOR MONOIDS
This page was built for publication: FINITENESS CONDITIONS FOR REWRITING SYSTEMS
