Church-Rooser property and homology of monoids

DOI10.1017/S096012950000133XzbMath0748.68035MaRDI QIDQ4006234

Yves Lafont, Alain Prouté

Publication date: 26 September 1992

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

homology groupfinitely presented monoidsfinite canonical rewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID ⋮ A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) ⋮ 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. ⋮ Effective topological complexity of orientable-surface groups ⋮ Algebra and geometry of rewriting ⋮ Syntactical methods for braids of three strands ⋮ Polygraphs of finite derivation type ⋮ Extraction of concurrent processes from higher dimensional automata

Cites Work

• Unnamed Item
• A note on a special one-rule semi-Thue system
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• On the classifying spaces of discrete monoids
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems