Pages that link to "Item:Q1102946"

The following pages link to On deciding the confluence of a finite string-rewriting system on a given congruence class (Q1102946):

Displaying 15 items.

• Using string-rewriting for solving the word problem for finitely presented groups (Q580494) (← links)
• The Knuth-Bendix algorithm and the conjugacy problem in monoids. (Q633198) (← links)
• On weakly confluent monadic string-rewriting systems (Q685433) (← links)
• Some decision problems about controlled rewriting systems (Q910246) (← links)
• About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
• Decision problems for finite special string-rewriting systems that are confluent on some congruence class (Q912986) (← links)
• A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
• Completing a finite special string-rewriting system on the congruence class of the empty word (Q1191634) (← links)
• Some properties of finite special string-rewriting systems (Q1201349) (← links)
• The pre-NTS property is undecidable for context-free grammars (Q1208437) (← links)
• \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
• Lambda-confluence for context rewriting systems (Q2344748) (← links)
• It is decidable whether a monadic thue system is canonical over a regular set (Q3210188) (← links)
• The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems (Q4013403) (← links)
• A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)