22a-Counting - Recursive Definitions and Introduction...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Recursive Definitions and Counting Discrete Mathematics
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Discrete Mathematics - Recursive Definitions and Counting 22-2 Previous Lecture Strong induction Induction and well ordering Recursively defined functions
Background image of page 2
Discrete Mathematics - Recursive Definitions and Counting 22-3 Recursively Defined Sets and Structures Induction can be used to define structures We need to complete the same two steps: Basis step: Define the simplest structure possible Inductive step: A rule, how to build a bigger structure from smaller ones.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Discrete Mathematics - Recursive Definitions and Counting 22-4 Well Formed Propositional Statements What is a well formed statement? (p q) ¬ r is well formed (p q) ¬ r is not Recursive definition of well formed formulas Basis step: A primitive statement is a well formed statement Inductive step: If Φ and Ψ are well formed statements, then ¬ Φ , ( Φ Ψ ), ( Φ Ψ ), ( Φ Ψ ), ( Φ Ψ ), ( Φ Ψ ) are well formed statements Such a definition can be used by various algorithms, for example, parsing
Background image of page 4
Discrete Mathematics - Recursive Definitions and Counting 22-5 Fractals Fractals are curves defined recursively Basis step: Fractal of level 0 is just a segment Inductive step: Divide every segment of the fractal of level k into 3 equal parts and remove the middle one. Insert in this place two sides of a equilateral triangle
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Discrete Mathematics - Recursive Definitions and Counting 22-6 Rooted Trees A binary tree is a graph formed by the following recursive definition Basis case:
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/12/2010 for the course MACM 201 taught by Professor Marnimishna during the Fall '09 term at Simon Fraser.

Page1 / 13

22a-Counting - Recursive Definitions and Introduction...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online