Pages that link to "Item:Q673144"
From MaRDI portal
The following pages link to A finitely presented monoid which has solvable word problem but has no regular complete presentation (Q673144):
Displaying 5 items.
- Constructing finitely presented monoids which have no finite complete presentation (Q1357103) (← links)
- Finitely presented monoids with linear Dehn function need not have regular cross-sections. (Q2247984) (← links)
- The monoids of the patience sorting algorithm (Q4629511) (← links)
- Gröbner bases of associative algebras and the Hochschild cohomology (Q4830360) (← links)
- Numerical upper bounds on growth of automaton groups (Q5063204) (← links)
