2 votes 2 votes Which of the following strings is a member of the language over $\{a, b\}$ defined by the regular expression $(aa + ab)^*(bb)^*$ ? $abbbba$ $abaabb$ $babbaa$ $bbaa$ Theory of Computation go2025-toc-1 regular-expression + – gatecse asked Sep 29, 2020 • edited Sep 29, 2020 by Lakshman Bhaiya gatecse 78 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes The given regular expression does not generate any string where "a" comes after any "bb". This rules out options A, C and D. Option B is indeed generated by the given regular expression. gatecse answered Sep 29, 2020 • selected Sep 26, 2021 by Arjun gatecse comment Share Follow See all 0 reply Please log in or register to add a comment.