'Concat' presentation slideshows

> f:= n -> [seq([n-k, n-k], k=0..n)]; f := n -> [seq([n - k, n - k], k = 0 .. n)]

> f:= n -> [seq([n-k, n-k], k=0..n)]; f := n -> [seq([n - k, n - k], k = 0 .. n)] > f(6); [[6, 6], [5, 5], [4, 4], [3, 3], [2, 2], [1, 1], [0, 0]] > h:= n -> [seq([n-k, k], k=0..n)]; h := n -> [seq([n - k, k], k = 0 .. n)] > h(6);

350 views • 26 slides

Numerical Representation of Strings

Numerical Representation of Strings. First, we define two primitive recursive functions. where R(x, y) and ?x / y? are defined as in Section 3.7.

334 views • 18 slides

User inputs

221 views • 13 slides