engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Regular Languages
Consider the language L on A = {a, b, c} which consists of all words of form w = arbsct where r, s, t > 0.
Which of the following is/are valid regular expression ‘r’ such that L = L(r)?
1
r = a*b*c*
2
r = aa*bb*cc*
3
r = aa*b*cc*
4
r = a+b+c+