Question 17353 – NTA UGC NET Dec 2023 Paper-2

L is a language consisting of strings that can be formed by concatenating the strings “ab”, “aa”, and “baa”.
To determine if a string is in L, we must check if it can be constructed using only those three strings.
Let’s analyze each option:
abaabaaabaa: Can be formed as “ab” + “aa” + “baa” + “ab” + “aa” + “baa”.
aaaabaaaa: Can be formed as “aa” + “aa” + “baa” + “aa” + “aa”.
baaaaabaa: Can be formed as “baa” + “aa” + “baa” + “aa”.
However, baaaaabaaaab cannot be formed using the strings in L.