Let P be a regular language and Q be context-free language such that Q ? P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n? N}) . Then which of the following is ALWAYS regular?
A) P ? Q
B) P - Q
C) ?* - P
D) ?* - Q
Correct Answer:
Verified
Q27: The minimum state automaton equivalent to the
Q28: Which one of the following languages over
Q29: Let w be any string of length
Q30: Which of the following are regular sets?
A)I
Q31: A minimum state deterministic finite automation accepting
Q33: Given a Non-deterministic Finite Automation (NFA) with
Q34: Which one of the following statement is
Q35: The …………. is said to be ambiguous
Q36: Type-1 Grammar is known as_
A)CFG
B)CSG
C)REGULAR
D)All
Q37: If G is "S ? a S/a",
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents