Question
Download Solution PDFLet L={ab, aa, baa}. Which of the following strings are not in L*.
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFThe correct answer isbaaaaabaaaab
EXPLANATION:
The closure of a language L is denoted L* and represents the set of those strings that can be formed by taking any number of strings from L, possibly with repetitions (i.e., the same string may be selected more than once) and concatenating all of them. pairs.Given the language L = { ab, aa, baa}
- Option 1: abaabaaabaa
- True, L* has "abaabaaabaa" is a correct combination. "ab aa baa ab aa".
- Option 2: aaaabaaaa
- True, L* has "aaaabaaaa" is a correct combination. "aa aa baa aa".
- Option 3: baaaaabaaaab
- False , L* can not accept "baaaaabaaaab" combination. "baa aa ab aa aa b". It is ending with "b" can not accept the given automata.
- Option 4: baaaabaa
- True, L* has "baaaabaa" is a correct combination. "baa aa baa".
Hence the correct answer is baaaaabaaaab.
Last updated on Jun 12, 2025
-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.