Pages that link to "Item:Q3992022"
From MaRDI portal
The following pages link to The equivalence of pre-NTS grammars is decidable (Q3992022):
Displaying 6 items.
- Remarques sur les langages de parenthèses (Q800094) (← links)
- The equivalence and inclusion problems for NTS languages (Q1083219) (← links)
- NTS languages are deterministic and congruential (Q1083220) (← 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)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)