Word problems and a homological finiteness condition for monoids

DOI10.1016/0022-4049(87)90129-0zbMath0648.20045OpenAlexW2003559293MaRDI QIDQ1105040

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0022-4049(87)90129-0

zbMATH Keywords

irreducible elements free monoid boundary map solvable word problem replacements complete rewriting system free \({bbfZ}S\)-resolution terminating Church-Rosser presentation type \((FP)_ 3\)

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Homological methods in group theory (20J05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (82)

Semigroups satisfying x m+n = x n ⋮ 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 ⋮ Graph groups are biautomatic ⋮ A finiteness condition for rewriting systems ⋮ Commutative monoids have complete presentations by free (non-commutative) monoids ⋮ A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods ⋮ Complete semi-Thue systems for abelian groups ⋮ A Lyndon's identity theorem for one-relator monoids ⋮ An introduction to commutative and noncommutative Gröbner bases ⋮ A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) ⋮ THE HOMOLOGICAL FINITENESS PROPERTY FP₁ AND FINITE GENERATION OF MONOIDS ⋮ Restrictions of congruences generated by finite canonical string-rewriting systems ⋮ On the Efficiency of the Direct Products of Monogenic Monoids ⋮ FDT is undecidable for finitely presented monoids with solvable word problems ⋮ Ends for subsemigroups of finite index. ⋮ 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 ⋮ Minimal But Inefficient Presentations for Self Semidirect Products of the Free Abelian Monoid on Two Generators ⋮ Complexity, combinatorial group theory and the language of palutators ⋮ Soluble groups with a finite rewriting system ⋮ An algorithm for computing homology groups ⋮ Pseudo-natural algorithms for finitely generated presentations of monoids and groups ⋮ Weights, growth, and amenability ⋮ Infinite complete group presentations ⋮ Low-dimensional (co)homology of free Burnside monoids ⋮ A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods ⋮ Growth functions, rewriting systems, and the Euler characteristic ⋮ Finite derivation type for semi-direct products of monoids ⋮ Conditional semi-Thue systems for presenting monoids ⋮ Analysis approach to finite monoids ⋮ Homology of Gaussian groups. ⋮ For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide ⋮ Shuffle polygraphic resolutions for operads ⋮ Topological finiteness properties of monoids. I: Foundations ⋮ Towards an algebraic theory of Boolean circuits. ⋮ The algebra of rewriting for presentations of inverse monoids ⋮ About the descriptive power of certain classes of finite string-rewriting systems ⋮ Generators and relations for subsemigroups via boundaries in Cayley graphs. ⋮ The next step of the word problem over monoids. ⋮ Higher-dimensional normalisation strategies for acyclicity ⋮ A new approach to connect algebra with analysis: relationships and applications between presentations and generating functions ⋮ Complete rewriting systems and homology of monoid algebras ⋮ On some homotopical and homological properties of monoid presentations. ⋮ Effective topological complexity of orientable-surface groups ⋮ Algebra and geometry of rewriting ⋮ A finitely presented monoid which has solvable word problem but has no regular complete presentation ⋮ The word problem for one-relation monoids: a survey ⋮ Rewriting in Varieties of Idempotent Semigroups ⋮ Theorem proving with group presentations: Examples and questions ⋮ Finitely presented monoids with linear Dehn function need not have regular cross-sections. ⋮ Möbius functions and confluent semi-commutations ⋮ A folk model structure on omega-cat ⋮ Presentations of higher dimensional Thompson groups. ⋮ THE p-COCKCROFT PROPERTY OF THE SEMI-DIRECT PRODUCTS OF MONOIDS ⋮ ON THE ZAPPA-SZÉP PRODUCT ⋮ Convergent presentations and polygraphic resolutions of associative algebras ⋮ FINITENESS CONDITIONS FOR REWRITING SYSTEMS ⋮ A NEW EXAMPLE FOR MINIMALITY OF MONOIDS ⋮ Groupoids and the algebra of rewriting in group presentations ⋮ Topological rewriting systems applied to standard bases and syntactic algebras ⋮ Polygraphic resolutions and homology of monoids ⋮ Presentations for subgroups of monoids ⋮ Rewriting systems in alternating knot groups with the Dehn presentation ⋮ A cubical Squier’s theorem ⋮ Finite complete rewriting systems and finite derivation type for small extensions of monoids ⋮ Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings ⋮ A convenient category of locally preordered spaces ⋮ On 0-homology of categorical at zero semigroups. ⋮ Finite homotopy bases of one-relator monoids ⋮ Efficiency for self semi-direct products of the free Abelian monoid on two generators. ⋮ Homotopy reduction systems for monoid presentations ⋮ Artin groups, rewriting systems and three-manifolds ⋮ Polygraphs of finite derivation type ⋮ An almost-confluent congruential language which is not Church-Rosser congruential ⋮ A short scientific biography of Maurice Nivat ⋮ Rewriting systems of Coxeter groups ⋮ Rewriting in Gray categories with applications to coherence ⋮ Confluence of algebraic rewriting systems ⋮ A rewriting coherence theorem with applications in homotopy type theory

Cites Work

This page was built for publication: Word problems and a homological finiteness condition for monoids