Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Regular Languages and Finite Automata Regular Languages
Let L={ab, aa, baa}. Which of the following strings are not in L*.
1
abaabaaabaa
2
aaaabaaaa
3
baaaaabaaaab
4
baaaaabaa