P, Q, R are three languages, if P and R are regular and if PQ = R, then
A. | Q has to be regular |
B. | Q cannot be regular |
C. | Q need not be regular |
D. | Q cannot be a CFL |
Option: C Explanation : |
A class of language that is closed under
A. | union and complementation has to be closed under intersection |
B. | intersection and complement has to be closed under union |
C. | union and intersection has to be closed under complementation |
D. | both (A) and (B) |
Option: D Explanation : |
The productions
E—>E+E
E—>E—E
E-->E*E
E —> E / E
E —> id
A. | generate an inherently ambiguous language |
B. | generate an ambiguous language but not inherently so |
C. | are unambiguous |
D. | can generate all possible fixed length valid computation for carrying out addition, subtraction, multipication and division, which can be expressed in one expression |
Option: B Explanation : |
Which of the folowing definitions below generates the same language as L, where
L = {xn yn such that n > = 1} ?
I. E —> xEy | xy
II. xy | (x+ xyy+)
III .x+y+
A. | I only |
B. | I and II |
C. | II and III |
D. | II only |
Option: A Explanation : |
Following context free grammar
S —> aB | bA
A —>b | aS | bAA
B —> b | bS | aBB
generates strings of terminals that have
A. | equal number of a's and b's |
B. | odd number of a's and odd number b's |
C. | even number of a's and even number of b's |
D. | odd number of a's and even number of a's |
Option: A Explanation : |
Syllabus covered in this section is-
This Section covers Theory of Computation Questions Answers .These questions can be used for the preparation of various competitive and academic exams like
Who can benefit
Various Search Terms Used For This Section Are