Pages that link to "Item:Q1123619"

The following pages link to Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619):

Displaying 2 items.

• Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
• Restrictions of congruences generated by finite canonical string-rewriting systems (Q5055732) (← links)