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.
Try to provide precise and to the point comments avoiding irrelevant details.
How is this a C++ question?