Teaching TN TRB CS Mock Test Theory of Computation Regular Languages and Finite Automata Regular Languages
If L = {ab, c} is aa language over the set A = {a, b, c}, then L3 is:
1
{ababc, abcab, abc2, cabab, cabc, c2ab, c3}
2
{ababab, ababc, abcab, abc2, cabab, cabc, c2ab, c3}
3
{ababab, ababc, abcab, abc2abab, cabab, cabc, c2ab, c3}
4
{ababab, ababc, abcab, abc2, cabab, c2ab, c3}