Pages that link to "Item:Q1074716"
From MaRDI portal
The following pages link to Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716):
Displaying 17 items.
- Space functions and space complexity of the word problem in semigroups. (Q395608) (← links)
- Volume distortion in groups. (Q631331) (← links)
- Finiteness and Dehn functions of automatic monoids having directed fellow traveller property. (Q731326) (← links)
- A strong geometric hyperbolicity property for directed graphs and monoids. (Q743919) (← links)
- The Dehn function of Richard Thompson's group \(F\) is quadratic. (Q818633) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- Thue systems as rewriting systems (Q1099642) (← links)
- Complexity, combinatorial group theory and the language of palutators (Q1105698) (← links)
- Pseudo-natural algorithms for finitely generated presentations of monoids and groups (Q1115973) (← links)
- McNaughton families of languages. (Q1401181) (← links)
- Polynomially-bounded Dehn functions of groups (Q1630588) (← links)
- Algorithmically complex residually finite groups (Q1682244) (← links)
- Dehn functions of finitely presented metabelian groups (Q1983948) (← links)
- Algorithmic problems in groups with quadratic Dehn function (Q2694791) (← links)
- Space functions of groups (Q2841376) (← links)
- Asymptotic invariants, complexity of groups and related problems (Q3143713) (← links)
- Logspace and compressed-word computations in nilpotent groups (Q5100019) (← links)
