September 8

September 8 - CSCI 2670 Introduction to Theory of Computing...

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

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing September 8, 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
Announcement Remove problems 1.46c and 1.55(c,f,j) from your  homework assignments New assignment 1.7(d,h), 1.16b, 1.21b (show the  GNFA steps),1.19a Old text numbers 1.5(d,g), 1.12b, 1.16b, 1.14a
Background image of page 2
Agenda This week Proved every RE has a corresponding DFA I.e., every RE describes a regular language Showed how to convert GNFA to RE Today Prove every DFA has a corresponding RE Example of conversion from GNFA to RE Proving a language is not regular?
Background image of page 3

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

View Full DocumentRight Arrow Icon
Accounting for loops a a a a q ’ q ’ a a a a a a a a q q q a a a a a a a a a a a a a
Background image of page 4
Every DFA has a corresponding RE Proof:  Let M be any DFA and let w be any string in  Σ * .  Convert M to G, a GNFA, then convert G to  R, a regular expression, using methods shown in  class.  Want to show w L(M) iff w L(R).   First show w L(M) iff w L(G).   Then show w L(G) iff w L(R).
Background image of page 5

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

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 17

September 8 - CSCI 2670 Introduction to Theory of Computing...

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

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