Pages that link to "Item:Q1123619"
From MaRDI portal
The following pages link to Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619):
Displaying 6 items.
- Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
- An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems (Q1057263) (← links)
- Complexity of certain decision problems about congruential languages (Q1085618) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete (Q3720578) (← links)
- Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)