engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Regular Languages and Finite Automata Regular Languages
Given the language L = {ab, aa, baa}, which of the following strings are in L * ?
1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa
1
1, 2 and 3
2
2, 3 and 4
3
1, 2 and 4
4
1, 3 and 4