September 7 - state to every other state and also from each...

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

View Full Document Right Arrow Icon
CSCI 2670 Introduction to Theory of Computing September 7, 2005
Image of page 1

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

View Full Document Right Arrow Icon
Agenda • Yesterday – 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 • Tomorrow – Proving a language is not regular
Image of page 2
GNFA’s A GNFA is an NFA with the following properties: 1. The start state has transition arrows going to every other state, but no arrows coming in from any other state 2. There is exactly one accept state and there is an arrow from every other state to this state, but no arrows to any other state from the accept state 3. The start state is not the accept state
Image of page 3

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

View Full Document Right Arrow Icon