FINITENESS CONDITIONS FOR REWRITING SYSTEMS

DOI10.1142/S0218196705002074MaRDI QIDQ4680589zbMATH OpenFDO

Authors 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)

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

zbMATH Keywords

finite derivation typefinite homological type

Mathematics Subject Classification ID

Topological methods in group theory (57M07) Grammars and rewriting systems (68Q42) Connections of semigroups with homological algebra and category theory (20M50) Free semigroups, generators and relations, word problems (20M05)

Recommendations

• A finiteness condition for rewriting systems
• A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
• Finite complete rewriting systems and finite derivation type for small extensions of monoids
• scientific article; zbMATH DE number 1419256
• Polygraphs of finite derivation type

Cites work

• scientific article; zbMATH DE number 3659836 (Why is no real title available?)
• scientific article; zbMATH DE number 3351865 (Why is no real title available?)
• A Monoid which is Right FP _∞ but not Left FP ₁
• A finiteness condition for rewriting systems
• A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
• FOR REWRITING SYSTEMS THE TOPOLOGICAL FINITENESS CONDITIONS FDT AND FHT ARE NOT EQUIVALENT
• 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
• For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
• Homological Finite Derivation Type
• Homotopy reduction systems for monoid presentations
• LOW-DIMENSIONAL HOMOTOPY THEORY FOR MONOIDS
• Low dimensional homotopy for monoids II: groups
• ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS
• On the Algebra of Semigroup Diagrams
• RELATION MODULES AND RELATION BIMODULES OF GROUPS, SEMIGROUPS AND ASSOCIATIVE ALGEBRAS
• SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID
• Word problems and a homological finiteness condition for monoids

Cited in

(14)

• scientific article; zbMATH DE number 1419256 (Why is no real title available?)
• For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\)
• Semigroups with finitely generated universal left congruence
• On some homotopical and homological properties of monoid presentations.
• Rewriting systems and Hochschild-Mitchell homology
• On higher order homological finiteness of rewriting systems.
• A finiteness condition for rewriting systems
• Higher-dimensional normalisation strategies for acyclicity
• Finite canonical rewriting systems for congruences generated by concurrency relations
• Low dimensional homotopy for monoids II: groups
• The problems of cyclic equality and conjugacy for finite complete rewriting systems
• Polygraphs of finite derivation type
• Topological finiteness properties of monoids. I: Foundations
• On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids

This page was built for publication: FINITENESS CONDITIONS FOR REWRITING SYSTEMS

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