Word problems and a homological finiteness condition for monoids
From MaRDI portal
(Redirected from Publication:1105040)
Recommendations
Cites work
- scientific article; zbMATH DE number 3125399 (Why is no real title available?)
- scientific article; zbMATH DE number 3898258 (Why is no real title available?)
- scientific article; zbMATH DE number 3656204 (Why is no real title available?)
- scientific article; zbMATH DE number 3528212 (Why is no real title available?)
- scientific article; zbMATH DE number 3556332 (Why is no real title available?)
- scientific article; zbMATH DE number 3572386 (Why is no real title available?)
- scientific article; zbMATH DE number 3227055 (Why is no real title available?)
- scientific article; zbMATH DE number 3377452 (Why is no real title available?)
- A Finitely Presented Group Whose 3-Dimensional Integral Homology is not Finitely Generated
- A connection between the integral homology and the centre of a rational linear group
- A note on a special one-rule semi-Thue system
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Finiteness properties of groups
- Finiteness properties of solvable S-arithmetic groups: An example
- Free differential calculus. I: Derivation in the free group ring. II: The isomerphism problem of groups. III: Subgroups
- On theories with a combinatorial definition of 'equivalence'
- Some Properties of Conversion
- The first cohomology of a group with permutation module coefficients
Cited in
(86)- Complete rewriting systems and homology of monoid algebras
- Theorem proving with group presentations: examples and questions
- A rewriting coherence theorem with applications in homotopy type theory
- Efficiency for self semi-direct products of the free Abelian monoid on two generators.
- A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods
- Shuffle polygraphic resolutions for operads
- A short scientific biography of Maurice Nivat
- A lower bound of the number of rewrite rules obtained by homological methods
- Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions.
- Homology of Gaussian groups.
- Effective topological complexity of orientable-surface groups
- Infinite complete group presentations
- Presentations for subgroups of monoids
- A folk model structure on omega-cat
- Complete semi-Thue systems for abelian groups
- Polygraphic resolutions and homology of monoids
- A cubical Squier's theorem
- Growth functions, rewriting systems, and the Euler characteristic
- Free precategories as presheaf categories
- On some homotopical and homological properties of monoid presentations.
- Finite derivation type for semi-direct products of monoids
- Rewriting systems in alternating knot groups with the Dehn presentation
- Ends for subsemigroups of finite index.
- Complexity, combinatorial group theory and the language of palutators
- Analysis approach to finite monoids
- Finite complete rewriting systems and finite derivation type for small extensions of monoids
- A convenient category of locally preordered spaces
- Rewriting systems of Coxeter groups
- A finiteness condition for rewriting systems
- The algebra of rewriting for presentations of inverse monoids
- An introduction to commutative and noncommutative Gröbner bases
- Finite homotopy bases of one-relator monoids
- Rewriting in Gray categories with applications to coherence
- FINITENESS CONDITIONS FOR REWRITING SYSTEMS
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier)
- Graph groups are biautomatic
- Homotopy reduction systems for monoid presentations
- Constructing finitely presented monoids which have no finite complete presentation
- Convergent presentations and polygraphic resolutions of associative algebras
- Higher-dimensional normalisation strategies for acyclicity
- Low-dimensional (co)homology of free Burnside monoids
- Weights, growth, and amenability
- On the Efficiency of the Direct Products of Monogenic Monoids
- Algebra and geometry of rewriting
- Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
- Möbius functions and confluent semi-commutations
- SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID
- On 0-homology of categorical at zero semigroups.
- THE p-COCKCROFT PROPERTY OF THE SEMI-DIRECT PRODUCTS OF MONOIDS
- Rewriting in varieties of idempotent semigroups
- Confluence of algebraic rewriting systems
- The word problem for one-relation monoids: a survey
- About the descriptive power of certain classes of finite string-rewriting systems
- Minimal But Inefficient Presentations for Self Semidirect Products of the Free Abelian Monoid on Two Generators
- Commutative monoids have complete presentations by free (non-commutative) monoids
- For finitely presented monoids the homological finiteness conditions FHT and \(\text{bi-FP}_3\) coincide
- Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry
- A new approach to connect algebra with analysis: relationships and applications between presentations and generating functions
- Artin groups, rewriting systems and three-manifolds
- Generators and relations for subsemigroups via boundaries in Cayley graphs.
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups
- The next step of the word problem over monoids.
- Towards an algebraic theory of Boolean circuits.
- THE HOMOLOGICAL FINITENESS PROPERTY FP1 AND FINITE GENERATION OF MONOIDS
- ON THE WORD PROBLEM FOR TENSOR PRODUCTS AND AMALGAMS OF MONOIDS
- A Lyndon's identity theorem for one-relator monoids
- THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS
- An algorithm for computing homology groups
- Tangent complexes and the Diamond Lemma
- Topological rewriting systems applied to standard bases and syntactic algebras
- Groupoids and the algebra of rewriting in group presentations
- A new example for minimality of monoids.
- An almost-confluent congruential language which is not Church-Rosser congruential
- Presentations of higher dimensional Thompson groups.
- Restrictions of congruences generated by finite canonical string-rewriting systems
- FDT is undecidable for finitely presented monoids with solvable word problems
- Conditional semi-Thue systems for presenting monoids
- Finitely presented monoids with linear Dehn function need not have regular cross-sections.
- Polygraphs of finite derivation type
- Soluble groups with a finite rewriting system
- ON THE ZAPPA-SZÉP PRODUCT
- Topological finiteness properties of monoids. I: Foundations
- Semigroups satisfying x m+n = x n
- ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS
- SECOND ORDER DEHN FUNCTIONS OF GROUPS AND MONOIDS
- A finitely presented monoid which has solvable word problem but has no regular complete presentation
This page was built for publication: Word problems and a homological finiteness condition for monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105040)
