Theory of Computation - CSE 105 Context-free Languages ...

2013-12-22 · Designing PDAs Problem 6 Give an informal description and state diagram for the language L = {w|w = wR, that is, w is a palindrome This is fairly simple: we can push the first half of w, nondeterministically guess where its middle is, and start popping the stack for the second half of w, making sure the second half matches what we pop off the ...

Alexa Traffic


Listing Links