# CS402 GDB Solution Feb 2015

GDB Topic: Can Push Down Automaton (PDA) with n-stacks be equally powerful to a Turing machine while dealing Context Free Languages (CFG)? Justify your point of view with logical reasons in either case. Solution: Yes it is true, Turing machines are more powerful than PDAs. The easiest example would be to show that Turing machines can […]