Back to Browse

GATE CSE 1991

125 views
Dec 28, 2021
2:16

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 1991 Which one of the following is the strongest correct statement about a finite language over some finite alphabet ∑? A) It could be un-decidable B) It is Turing-machine recognizable C) It is a regular language D) It is a context-sensitive language

Download

0 formats

No download links available.

GATE CSE 1991 | NatokHD