Pages that link to "Item:Q4013403"
From MaRDI portal
The following pages link to The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403):
Displaying 4 items.
- On weakly confluent monadic string-rewriting systems (Q685433) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- Lambda-confluence for context rewriting systems (Q2344748) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
