1. Discrete Structure Li Tak Sing( 李德成 ) Lecture 13 1

2. More examples on inductively defined sets Find an inductive definition for each set S of strings. 1.Even palindromes over the set {a,b} 2.Odd palindromes over the set {a,b} 3.All palindromes over the set {a,b} 4.The binary numerals. 2

3. Solution 3

4. More examples on inductively defined sets Find an inductive definition for each set S of lists. 1.{,,,..} 2.{,,,..} 3.{,,,,,,...} 4.{L| L is a list with even length over {0,1,2}} 4

5. Solution 5

6. More examples on inductively defined sets Find an inductive definition for the set B of binary trees that represent arithmetic expressions that are either numbers in N or expressions that use operations + or -. 6

7. Solution 7

8. More examples on inductively defined sets Find an inductive definition for each subset S of N  N. 1.S={(x,y)| y=x or y=x+1} 2.S={(x,y) | x is even and y  x/2 8

9. Solution 9

10. Recursive Functions and Procedures Procedure  A program that performs one or more actions.  A procedure may return one or more values through its argument list. For example, a statement like allocate(m,a,s) might perform the action of allocating a block of m memory cells and return the values a and s, where a is the beginning address of the block and the s tells whether the allocation was successful. 10

11. Definition of recursively defined A function or a procedure is said to be recursively defined if it is defined in terms of itself. If S is an inductively defined set, then we can construct a function f with domain S as follow:  For each basis element x  S, specify a value for f(x).  Give rules that, for any inductively defined element x  S, will define f(x) in terms of previously defined value of f. 11

12. Constructing a recursively defined procedure If S if an inductively defined set, we can construct a procedure P to process the elements of S as follows:  For each basis element x  S, specify a set of actions for P(x).  Give rules that, for any inductively defined element x  S, will define the actions of P(x) in terms of previously defined actions of P. 12

13. Numbers Sum of integers. f(n)=0+1+2+...+n Definition:  f(n)= if n=0 then 0 else f(n-1)+n  Alternatively, it can be written as f(0)=0 f(n)=f(n-1)+n This is known as the pattern matching method 13

14. Numbers Adding odd numbers f(n)=1+3+...+(2n+1) Definition:  f(0)=1  f(n)=f(n-1)+(2n+1) 14

15. The rabbit program The Fibonacci numbers are the numbers in the sequence 0,1,1,2,3,5,8,13 where each number after the first two is computed by adding the preceding two numbers. Assume that at the beginning there is one pair of rabbits. They give birth to another pair of rabbit in one month. Let f(n) represents the number of pairs of rabbits at the n-th month. At that time, there were only f(n-2) mature rabbits which give birth to f(n-2) new rabbits. So the total number of rabbits is the total number of rabbits at the (n-1)th month plus these newly born f(n-2) rabbits. So f(n)=f(n-1)+f(n-2) The sequence 0,1,1,2,3,... is called the Fibonacci numbers. 15

16. Sum and product notation Sum of sequence a 1,a 2,....,a n Product of a sequence a 1,a 2,....,a n 16

17. Factorial n!=1  2 .....  n 0!=1 n!=(n-1)!  n 17

18. Examples Construct a recursive definition for each of the following functions, where all variables are natural numbers. 1.f(n)=0+2+4+...+2n. 2.f(n)=floor(0/2)+floor(1/2)+....+floor(n/2). 3.f(n,k)=k+(k+1)+(k+2)+...+(k+n). 4.f(n,k)=0+k+2k+...+nk. 18

19. 19

20. Lists f(n)= f(n)= if n=0 then else cons(n,f(n-1)) Using the pattern matching method  f(0)=  f(n)=cons(n, ) =cons(n,f(n-1)) 20

21. Recursive procedures Let P(n) be the procedure that prints out the numbers in the list. P(n): if n=0 then print(0) else print(n); P(n-1) fi 21

22. The distribute function dist(3, )= How to define this function recursively? dist(x,L)= if L=<> then <> else (x,head(L))::dist(x,tail(L)) Pattern matching method:  dist(x,<>)=<>  dist(x,a::L)=(x,a)::dist(x,L) 22

23. The pairs function pairs(, )= pairs(A,B)=if A=B=<> then <> else (head(A),head(B))::pairs(tail(A),tail(B)) pairs(<>,<>)=<>, pairs(x::T, y::U)=(x,y)::pairs(T,U) 23

24. Concatenation of Lists cat(, )= cat(L,M)=if L=<> then M else head(L)::cat(tail(L),M) Pattern matching method:  cat(<>,A)=A  cat(x::L,A)=x::cat(L,A) 24

25. Sorting a list by insertion sort(<>)=<> sort(x::L)=insert(x,sort(L)) insert(x,S)=if S=<> then else if x<head(S) then x::s else head(S)::insert(x,tail(S)) 25

26. Example Write recursive definition for the following list functions. 1.The function "last" that returns the last elemnt of a nonempty list. For example last( )=c 2.The function "front" that returns the list obtained by removing the last element of a nonempty list. For example front( )=. 26

27. Solution 27