45 citations · 137 across the 23 of their papers we have counts for
1 paper · 2 filters
Brian Courtehoute, Detlef Plump
We present a computation model based on a subclass of GP 2 graph programs which can simulate any off-line Turing machine of space complexity O(s(n) log s(n)) in space O(s(n)). The…