The following pages link to (Q4036570):
Displayed 6 items.
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- Completing a finite special string-rewriting system on the congruence class of the empty word (Q1191634) (← links)
- Computing presentations for subgroups of polycyclic groups and of context-free groups (Q1328439) (← links)
- The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
- Equational Theorem Proving for Clauses over Strings (Q6118747) (← links)