Pages that link to "Item:Q1264463"
From MaRDI portal
The following pages link to Infinite string rewrite systems and complexity (Q1264463):
Displaying 11 items.
- Space functions and space complexity of the word problem in semigroups. (Q395608) (← links)
- The derivational complexity of string rewriting systems (Q441853) (← links)
- Turing machines and bimachines (Q930927) (← links)
- Upper bound on the derivational complexity in some word rewriting system (Q1048539) (← links)
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups (Q1074716) (← links)
- McNaughton families of languages. (Q1401181) (← links)
- Reductions and functors from problems to word problems (Q1566706) (← links)
- Algorithmically complex residually finite groups (Q1682244) (← links)
- (Q4255520) (← links)
- Non-Looping String Rewriting (Q4718895) (← links)
- Infinite Families of Finite String Rewriting Systems and Their Confluence (Q4933319) (← links)