Back to Browse

GATE CSE 2000

160 views
Dec 28, 2021
1:49

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 2000 Consider the following decision problems: (P1) Does a given finite state machine accept a given string (P2) Does a given context free grammar generate an infinite number of stings Which of the following statements is true?(A) Both (P1) and (P2) are decidable(B) Neither (P1) nor (P2) are decidable (C) Only (P1) is decidable(D) Only (P2) is decidable

Download

0 formats

No download links available.

GATE CSE 2000 | NatokHD