September 20

September 20 - CSCI 2670 Introduction to Theory of...

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

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing September 20, 2005
Background image of page 1

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

View Full DocumentRight Arrow Icon
Agenda Last week Context-free grammars Examples, definition, strategies for building This week More on CFG’s Chomsky normal form, Pushdown automata, pumping  lemma for CFG’s
Background image of page 2
Announcement Recommended problems to do prior to next  Tuesday (9/27) 2.8, 2.9, 2.12, 2.13, 2.15, 2.16, 2.30 d I will post solutions to these problems on Friday Midterm next Tuesday I will hand out practice midterm tomorrow and  solutions the next day I will hold extra office hours on Friday 11:00 –  12:30
Background image of page 3

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

View Full DocumentRight Arrow Icon
Chomsky normal form Method of simplifying a CFG Definition:  A context-free grammar is in Chomsky normal  form if every rule is of one of the following forms  BC  a where a is any terminal and A is any variable, and B, and  C are any variables or terminals other than the start  variable if S is the start variable then the rule S    ε  is the only permitted  ε  rule 
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.

Page1 / 18

September 20 - CSCI 2670 Introduction to Theory of...

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

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