A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)

DOI10.1016/0022-4049(94)00043-IzbMath0832.20080MaRDI QIDQ1892306

Yves Lafont

Publication date: 3 July 1995

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

zbMATH Keywords

homology group; monoid; finite derivation type; finiteness condition; finite presentation

Mathematics Subject Classification ID

20M05: Free semigroups, generators and relations, word problems

20M35: Semigroups in automata theory, linguistics, etc.

20M50: Connections of semigroups with homological algebra and category theory

Related Items

FINITENESS CONDITIONS FOR REWRITING SYSTEMS, THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS, SECOND ORDER DEHN FUNCTIONS OF GROUPS AND MONOIDS, ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS, SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID, FDT is undecidable for finitely presented monoids with solvable word problems, Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry, Homology and closure properties of autostackable groups, Rewriting in Gray categories with applications to coherence, Confluence of algebraic rewriting systems, Homotopy bases and finite derivation type for subgroups of monoids., Higher-dimensional normalisation strategies for acyclicity, Bottom-up rewriting for words and terms, Polygraphic resolutions and homology of monoids, A convenient category of locally preordered spaces, Finite derivation type for semi-direct products of monoids, Finite complete rewriting systems and finite derivation type for small extensions of monoids, Homotopy reduction systems for monoid presentations, A finiteness condition for rewriting systems, Constructing finitely presented monoids which have no finite complete presentation, Homology of Gaussian groups., Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions., Towards an algebraic theory of Boolean circuits., Finite homotopy bases of one-relator monoids, A formal system of reduction paths for parallel reduction, On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids, A Lyndon's identity theorem for one-relator monoids, Finite derivation type for Rees matrix semigroups, Algebra and geometry of rewriting, Homological Finite Derivation Type, Polygraphs of finite derivation type

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Higher-dimensional word problems with applications to equational logic
• Complete rewriting systems and homology of monoid algebras
• Word problems and a homological finiteness condition for monoids
• A finiteness condition for rewriting systems
• Finite derivation type implies the homological finiteness condition \(FP_ 3\)
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Church-Rooser property and homology of monoids