Pages that link to "Item:Q685433"
From MaRDI portal
The following pages link to On weakly confluent monadic string-rewriting systems (Q685433):
Displaying 7 items.
- On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- The pre-NTS property is undecidable for context-free grammars (Q1208437) (← links)
- Computing presentations for subgroups of polycyclic groups and of context-free groups (Q1328439) (← links)
- Codes modulo finite monadic string-rewriting systems (Q1341747) (← links)
- McNaughton families of languages. (Q1401181) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
