Lecture12-1_Part28 - w 3 If N accepts-accept Otherwise – reject.“ Proof 28 w R,

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

View Full Document Right Arrow Icon
Consider P= “On a <RE, string> input : 1. Convert RE R to an equivalent NFA A . 2. Run TM N (See previous proof) 0n
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: w . 3. If N accepts -accept . Otherwise – reject .“ Proof 28 w R ,...
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