Pages that link to "Item:Q1105040"

The following pages link to Word problems and a homological finiteness condition for monoids (Q1105040):

Displaying 32 items.

• Efficiency for self semi-direct products of the free Abelian monoid on two generators. (Q2566476) (← links)
• Ends for subsemigroups of finite index. (Q2634952) (← links)
• Weights, growth, and amenability (Q2655976) (← links)
• Topological finiteness properties of monoids. I: Foundations (Q2688262) (← links)
• Rewriting in Varieties of Idempotent Semigroups (Q3014940) (← links)
• THE p-COCKCROFT PROPERTY OF THE SEMI-DIRECT PRODUCTS OF MONOIDS (Q3043625) (← links)
• A NEW EXAMPLE FOR MINIMALITY OF MONOIDS (Q3067243) (← links)
• Polygraphs of finite derivation type (Q3130298) (← links)
• Soluble groups with a finite rewriting system (Q4289419) (← links)
• Theorem proving with group presentations: Examples and questions (Q4647534) (← links)
• ON THE ZAPPA-SZÉP PRODUCT (Q4678650) (← links)
• FINITENESS CONDITIONS FOR REWRITING SYSTEMS (Q4680589) (← links)
• THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS (Q4786249) (← links)
• SECOND ORDER DEHN FUNCTIONS OF GROUPS AND MONOIDS (Q4786257) (← links)
• ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS (Q4786287) (← links)
• SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID (Q4786319) (← links)
• A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods (Q5043598) (← links)
• Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)
• FDT is undecidable for finitely presented monoids with solvable word problems (Q5055951) (← links)
• Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry (Q5063338) (← links)
• A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods (Q5089026) (← links)
• Conditional semi-Thue systems for presenting monoids (Q5096810) (← links)
• The algebra of rewriting for presentations of inverse monoids (Q5119294) (← links)
• A cubical Squier’s theorem (Q5220186) (← links)
• THE HOMOLOGICAL FINITENESS PROPERTY FP₁ AND FINITE GENERATION OF MONOIDS (Q5297226) (← links)
• On the Efficiency of the Direct Products of Monogenic Monoids (Q5297775) (← links)
• Minimal But Inefficient Presentations for Self Semidirect Products of the Free Abelian Monoid on Two Generators (Q5308808) (← links)
• Rewriting in Gray categories with applications to coherence (Q5877242) (← links)
• Confluence of algebraic rewriting systems (Q5879266) (← links)
• A rewriting coherence theorem with applications in homotopy type theory (Q5879270) (← links)
• Semigroups satisfying x m+n = x n (Q5881194) (← links)
• Shuffle polygraphic resolutions for operads (Q6134654) (← links)