Pages that link to "Item:Q1127336"

The following pages link to A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336):

Displaying 4 items.

• \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
• Lambda-confluence for context rewriting systems (Q2344748) (← links)
• Rational subsets of partially reversible monoids (Q2378535) (← links)
• LARS: a learning algorithm for rewriting systems (Q2384128) (← links)