Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Which of the following is (are) correct about the regular expression?
aa*bb*cc*dd*
A. The language for the given expression is:
L = {anbncmdm | n ≥ 1, m ≥ 1} U {anbmcmdn | n ≥ 1, m ≥ 1}
B. The Context Free Language for the given expression is:
S → AB | C
A → aAb | ab
B → cBd | cd
C → aCd | aDd
D → bDc | bc
C. The language generated by this expression is equal number of 'a's, followed by equal number of 'b's, followed by equal number of 'c's and followed by equal number of 'd's.
Choose the correct answer from the options given below:
1
Only A is correct
2
Only B is correct
3
Both A and B are correct
4
All the three A, B and C are correct