MCQ IN COMPUTER SCIENCE & ENGINEERING

Previous
Next

COMPUTER SCIENCE AND ENGINEERING

THEORY OF COMPUTATION

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Which of the following the given language belongs to?L={ambmcm| m>=1}
A
Context free language
B
Regular language
C
Both (a) and (b)
D
None of the mentioned
Explanation: 

Detailed explanation-1: -A language L is decidable if there is a Turing machine M such that L(M) = L and M halts on every input. Thus, if L is decidable then L is recursively enumerable.

Detailed explanation-2: -Which of the following does not represents the given language? Explanation: The given option represents 0, 01 in different forms using set operations and Regular Expressions. The operator like ^, v, etc. are logical operation and they form invalid regular expressions when used.

Detailed explanation-3: -Which of the following correctly recognize the symbol ‘|-’ in context to PDA? Explanation: Using this notation, we can define moves and further acceptance of a string by the machine. 6.

Detailed explanation-4: -Explanation: A context free language for which no unambiguous grammar exists, is called Inherent ambiguous language.

There is 1 question to complete.
Previous
Next