GATE CSE 1998

Planning to take coaching on Unacademy http://bit.ly/gate_unacademy or https://unacademy.com/ here is a code for 10% off PLUS1BPK1 Telegram Notification Group link:- https://t.me/joinchat/X5egW_cvdt9kMGY1 Telegram discussion Group link:- https://t.me/joinchat/VCyGUmVq8RNkMzhl Downloads resources from here https://education4fun.com/gate-cse/ MCQ (Single Correct Answer) GATE CSE 1998 Regarding the power of recognition of languages, which of the following statement is false? A) The non-deterministic finite-state automata are equivalent to deterministic finite-state automata. B) Non-deterministic Push-down automata are equivalent to deterministic Push-down automata. C) Non-deterministic Turing machines are equivalent to deterministic Turing machines. D) Multi-tape Turing machines are equivalent to Single-tape Turing machines.