Pages that link to "Item:Q1115973"
From MaRDI portal
The following pages link to Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973):
Displaying 4 items.
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups (Q4304125) (← links)
- EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (Q4904514) (← links)