Lecture12-1_Part34 - C and then it calls TM T to check...

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

View Full Document Right Arrow Icon
The TM machine F for Deciding EQ DFA gets as input to DFA-s A and B . This machine first activates the algorithms of Chapter 1 to construct DFA
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: C and then it calls TM T to check whether . If T accepts so does F . Otherwise F rejects. Proof 34 ( ) = C L...
View Full Document

Ask a homework question - tutors are online