Pages that link to "Item:Q1115973"

The following pages link to Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973):

Displaying 2 items.

• About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
• EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (Q4904514) (← links)