Course information

Prof: George Tourlakis

Course website: www.cse.yorku.ca/~gt/courses/

Evaluation Breakdown

- Homework (30%) , Midterm (30%), Final Exam (40%)
- Mathematical induction is very important
- PDA
- Push down automata
- Will accept {a
^{n}b^{n}| n≥0}

- Will accept {a

- Assignments are to be typed
- George uses LaTex for writing equations on a computer.
- mcTex is for PC

- George uses LaTex for writing equations on a computer.
- Book authors: Hopcroft / Ullman/ Motwani
- We will cover
- Finite Automata (FA)
- Push Down Automata (PDA)
- A little about TM's(mostly from Tourlakis's notes)

- Finite Automata (FA)
- Feb 19
^{th}is Test 1

- if a test is missed the percentage is added to the final exam
- other references
- webnotes

- webnotes
- Sets

- A , x, { , , ,}, { a a b}
- Used to denote sets

- Used to denote sets
- Order doesn't matter in a set
- Neither do repetitions
- {a,a,b} == {a,b} == {b,a}

- {a,a,b} == {a,b} == {b,a}
- N - Natural numbers symbol in McTax
- \mathb

- \mathb
- {x:P(x)}
- {X|p(x)}
- : and | used as 'such that' labels

- : and | used as 'such that' labels

- Russel paradox
- Does every math property P(x) determine a set?
- No!

- No!
- X ε Y
- {0} ε{1}
- False

- False
- {0} ε{0}
- True

- True
- How about R = {x ε x}?
- x ε R == x ε x

- x ε R == x ε x

R ε R = R ε R

## No comments:

Post a Comment