Pages that link to "Item:Q1057263"

The following pages link to An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems (Q1057263):

Displaying 11 items.

• Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
• The Church-Rosser property and special Thue systems (Q1071759) (← links)
• Thue systems as rewriting systems (Q1099642) (← links)
• On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946) (← links)
• Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule (Q1107523) (← links)
• The context-splittable normal form for Church-Rosser language systems. (Q1401938) (← links)
• Confluence problems for trace rewriting systems (Q1854457) (← links)
• Lambda-confluence for context rewriting systems (Q2344748) (← links)
• A note on thue systems with a single defining relation (Q3735697) (← links)
• The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403) (← links)
• On public-key cryptosystem based on Church-Rosser string-rewriting systems (Q6064030) (← links)