Pages that link to "Item:Q760506"
From MaRDI portal
The following pages link to Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group (Q760506):
Displaying 9 items.
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- A note on a special one-rule semi-Thue system (Q1067781) (← links)
- A finite Thue system with decidable word problem and without equivalent finite canonical system (Q1073016) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- Analysis of Dehn's algorithm by critical pairs (Q1100558) (← links)
- The word problem for one-relation monoids: a survey (Q1982573) (← links)
- Commutativity in groups presented by finite Church-Rosser Thue systems (Q3794395) (← links)
- Finite complete rewriting systems for groups (Q4384697) (← links)