This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 2 calls a decider. Also, M accepts <R,S> iff L(R) = L(R) L(S) i.e., iff L(R) L(S). Therefore, M is a decider for A so A is decidable. 4.19.1 Note that if the DFA accepts w R whenever it accepts w, then L(M) = L(M R ), where M R is the DFA that accepts the reverse of strings accepted by M. In a previous homework, we proved that if M is a regular language, then so is M R . Consider the following Turing machine T = On input <M>, where M is a DFA 1. Construct DFA N that accept the reverse of strings accepted by M 2. Submit <M,N> to the decider for EQ DFA 3. If it accepts, accept 4. If it rejects, reject. T is a decider since 1, 3, and 4 will not create an infinite loop and step 2 calls a decider. Also, T accept M iff L(M) = L(M R ). Therefore T decides S so S is decidable....
View Full Document
This note was uploaded on 02/07/2011 for the course CS 501 taught by Professor Sm during the Spring '11 term at Indiana.
- Spring '11