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 |
Answer : C Explanation : KALPANA SINGH said: (10:57pm on Sunday 4th June 2017)
As per decision rule only union, intersection and difference with other language and regular language are regular but no rule for concatenation it must be regular Q
AKASH MAHAJAN said: (11:07pm on Monday 18th September 2017)
by defination A is correct i.e Q has to be regular.Regular Grammer is closed under concatenation property, ie if A
|
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
