?={a,b}, L = {w : w is a palindrome, and #a(w) = #b(w)}. For example, abbaabba ? L; aba ? L because it has more a’s than b’s; ba ? L because it is not the same left-to right as right-to-left. Finish the proof, started below, which shows that L ? CFLs.
HW-2(2)
Computer Science
Theory of Computing (Csc 520 Course)
2. (12.5 points):
?={a,b}, L = {w : w is a palindrome, and #a(w) = #b(w)}. For example, abbaabba ? L; aba ? L because it has more a’s than b’s; ba ? L because it is not the same left-to right as right-to-left. Finish the proof, started below, which shows that L ? CFLs.
1. L? = L ? a*b*a*
2. If L ? CFLs then L? ? CFLs because the CFLs are closed under intersection with an RL.
3. If L? ? CFLs then L ? CFLs by applying the modus tollens logic rule to step 2.
4. Use the CF pumping theorem to show that L? ? CFLs.
4.a Let w = a?b²?a?. Then w ? L and |w| ? k, so that w can be expressed as the
concatenation of the substrings uvxyz, and the CF pumping theorem guarantees
apply.
How it works
Paste your instructions in the instructions box. You can also attach an instructions file
Select the writer category, deadline, education level and review the instructions
Make a payment for the order to be assignment to a writer
Download the paper after the writer uploads it
Will the writer plagiarize my essay?
You will get a plagiarism-free paper and you can get an originality report upon request.
Is this service safe?
All the personal information is confidential and we have 100% safe payment methods. We also guarantee good grades
Recent Comments