Pages that link to "Item:Q915431"

The following pages link to Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming (Q915431):

Displaying 4 items.

• Simulation of Turing machines by a regular rewrite rule (Q1199548) (← links)
• Reduction of cycle unification of type \(Cpg+r\) (Q1383467) (← links)
• Satisfiability of the smallest binary program (Q2366070) (← links)
• Primal grammars and unification modulo a binary clause (Q5210779) (← links)