Lecture12-1_Part24 - M(See previous proof 3 If C...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Consider N= “On a <NFA, string> input : 1. Convert NFA B to an equivalent DFA C . 2. Simulate C on input w using TM
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: M (See previous proof). 3. If C accepts -accept . Otherwise – reject .“ Proof 24 w B ,...
View Full Document

This note was uploaded on 04/30/2009 for the course CSE 105 taught by Professor Paturi during the Winter '99 term at UCSD.

Ask a homework question - tutors are online