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 (More than One Correct Answer)
GATE CSE 1992
In which of the cases stated below is the following statement true?“For every non-deterministic machine M1 there exists an equivalent deterministic machine M2 recognizing the same language“.
A) M1 is nondeterministic finite automation
B) M1 is a nondeterministic PDA
C) M1 is a non-deterministic Turing machine
D) For no machine M1 use the above statement true
