Unformatted text preview: is never visited twice. Part C. Every DFAacceptable language can be accepted by a DFA no state of which is ever visited more than once. Part D. Every DFAacceptable language can be accepted by a DFA with only a single ﬁnal state. Problem 4. Give two substantially diﬀerent proofs of the following: if L 1 and L 2 are DFAacceptable then L 1 ⊕ L 2 = { w : w is in exactly one of L 1 and L 2 } is DFAacceptable. 1...
View
Full Document
 Spring '10
 mr.

Click to edit the document details