3. Let L = {we {0,1}* w has an odd no. of 1's }, and let...

Transcribed Image Text:

3. Let L = {we {0,1}* w has an odd no. of 1's }, and let A be the DFA with tabular represen- tation: A → P * q 0 1 P 9 9 P Prove that L = L(A). Hint: Do the L(A) ≤ L part of the proof by induction on the the length of the string processed by A. You need a mutual induction with a claim for state p and a claim for state q. 3. Let L = {we {0,1}* w has an odd no. of 1's }, and let A be the DFA with tabular represen- tation: A → P * q 0 1 P 9 9 P Prove that L = L(A). Hint: Do the L(A) ≤ L part of the proof by induction on the the length of the string processed by A. You need a mutual induction with a claim for state p and a claim for state q.

Answer rating: 100% (QA)

To prove that L LA we need to show two things 1 LA L Every string in LA belongs to L 2 L LA Every st... View the full answer