Applying rewriting methods to special monoids
From MaRDI portal
Recommendations
Cites work
- Conjugacy in special monoids
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class
- On theories with a combinatorial definition of 'equivalence'
- Special monoids and special Thue systems
- Thue systems as rewriting systems
- Units of special Church-Rosser monoids
Cited in
(21)- On the descriptive power of special Thue systems
- Presentations for subgroups of monoids
- Units of special Church-Rosser monoids
- On the divisibility problem for one-relator monoids
- The word problem for one-relation monoids: a survey
- On equations and first-order theory of one-relator monoids
- Non-finitely generated maximal subgroups of context-free monoids
- On the word problem for special monoids
- scientific article; zbMATH DE number 1047959 (Why is no real title available?)
- SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID
- On some algorithmic problems for groups and monoids
- Rewriting with Frobenius
- COMPLETE REWRITING SYSTEMS FOR CODIFIED SUBMONOIDS
- On one-relator groups and units of special one-relation inverse monoids
- Prefix monoids of groups and right units of special inverse monoids
- Generators and relations for subsemigroups via boundaries in Cayley graphs.
- On groups of units of special and one-relator inverse monoids
- A word-hyperbolic special monoid with undecidable Diophantine problem
- Two-sided homological properties of special and one-relator monoids
- On right units of special inverse monoids
- Adjoining universal inverses to families of elements of free monoids
This page was built for publication: Applying rewriting methods to special monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5288344)