String rewriting and homology of monoids
From MaRDI portal
Publication:4344792
Cited in
(19)- Two recognizable string-matching problems over free partially commutative monoids
- Presentations of inverse semigroups, their kernels and extensions.
- scientific article; zbMATH DE number 475444 (Why is no real title available?)
- Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions.
- An almost-confluent congruential language which is not Church-Rosser congruential
- Homological finiteness properties of monoids, their ideals and maximal subgroups.
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.
- Semigroups with finitely generated universal left congruence
- Homology and closure properties of autostackable groups
- The set of strings mapped into a submonoid by iterates of a morphism
- Complete rewriting systems and homology of monoid algebras
- Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\)
- On monotone clones of strings
- About applications of distances on monoids of strings
- SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID
- ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS
- Units of the string link monoids
- On properties not inherited by monoids from their Schützenberger groups.
- Monoid presentations of groups by finite special string-rewriting systems
This page was built for publication: String rewriting and homology of monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344792)
