Advertisement
Guest User

Untitled

a guest
Oct 4th, 2015
59
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.31 KB | None | 0 0
  1. Basis: (0, 0) in S.
  2. Recursive step: If (m, n) in S then
  3. (m, n + 1) in S,
  4. (m + 1, n + 1) in S, and
  5. (m + 2, n + 1) in S
  6. Closure: The only points in S are those that can be generatede yb a
  7. finite number of applications of the recursive step.
  8.  
  9. m <= 2*n forall (m, n) in S
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement