Pages that link to "Item:Q915431"
From MaRDI portal
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 6 items.
- Simulation of Turing machines by a regular rewrite rule (Q1199548) (← links)
- Weighted systems of equations (Q1311966) (← links)
- Reduction of cycle unification of type \(Cpg+r\) (Q1383467) (← links)
- Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach (Q2032916) (← links)
- Satisfiability of the smallest binary program (Q2366070) (← links)
- Primal grammars and unification modulo a binary clause (Q5210779) (← links)