A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
From MaRDI portal
Publication:1892306
DOI10.1016/0022-4049(94)00043-IzbMath0832.20080MaRDI QIDQ1892306
Publication date: 3 July 1995
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Connections of semigroups with homological algebra and category theory (20M50)
Related Items
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, A finiteness condition for rewriting systems, Finite derivation type for Rees matrix semigroups, A Lyndon's identity theorem for one-relator monoids, 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, Constructing finitely presented monoids which have no finite complete presentation, Finite derivation type for semi-direct products of monoids, Homology of Gaussian groups., Homotopy bases and finite derivation type for subgroups of monoids., 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., Higher-dimensional normalisation strategies for acyclicity, Algebra and geometry of rewriting, A formal system of reduction paths for parallel reduction, On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids, Homological Finite Derivation Type, FINITENESS CONDITIONS FOR REWRITING SYSTEMS, Homology and closure properties of autostackable groups, Polygraphic resolutions and homology of monoids, Bottom-up rewriting for words and terms, Finite complete rewriting systems and finite derivation type for small extensions of monoids, A convenient category of locally preordered spaces, Finite homotopy bases of one-relator monoids, Homotopy reduction systems for monoid presentations, Polygraphs of finite derivation type, Rewriting in Gray categories with applications to coherence, Confluence of algebraic rewriting systems
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
