Pages that link to "Item:Q1357103"
From MaRDI portal
The following pages link to Constructing finitely presented monoids which have no finite complete presentation (Q1357103):
Displaying 9 items.
- A finitely presented monoid which has solvable word problem but has no regular complete presentation (Q673144) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- Commutative monoids have complete presentations by free (non-commutative) monoids (Q1085284) (← links)
- Word problems and a homological finiteness condition for monoids (Q1105040) (← links)
- Homotopy reduction systems for monoid presentations (Q1295568) (← links)
- A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) (Q1892306) (← links)
- On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids (Q2013556) (← links)
- Algebra and geometry of rewriting (Q2463397) (← links)
- Rewriting Systems and Embedding of Monoids in Groups (Q3617419) (← links)