The following pages link to (Q5583881):
Displaying 14 items.
- Algorithmically finite groups. (Q640937) (← links)
- Some properties of finite special string-rewriting systems (Q1201349) (← links)
- The word problem for one-relation monoids: a survey (Q1982573) (← links)
- On equations and first-order theory of one-relator monoids (Q2051781) (← links)
- Correction to: ``The word problem for one-relation monoids: a survey'' (Q2099148) (← links)
- Non-finitely generated maximal subgroups of context-free monoids (Q2099288) (← links)
- On the word problem for special monoids (Q2163877) (← links)
- Word problem for deterministic and reversible semi-Thue systems (Q2247995) (← links)
- Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups (Q2290969) (← links)
- On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups (Q4558123) (← links)
- On one-relator groups and units of special one-relation inverse monoids (Q5877774) (← links)
- Prefix monoids of groups and right units of special inverse monoids (Q6065478) (← links)
- On the word problem for weakly compressible monoids (Q6094257) (← links)
- Generic complexity of the word problem in some semigroups (Q6148012) (← links)