0 votes 0 votes Find nfa's that accept (a) $L ((a + b) a^*) ∩ L (baa^*)$. (b) $L (ab^*a^*) ∩ L (a^*b^*a)$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language closure-property + – Naveen Kumar 3 asked Apr 4, 2019 Naveen Kumar 3 470 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes (a) L((a+b)a*) intersection L(baa*) = L( a+,b,ba+ ) intersection L( ba+ ) = L( ba+ ) For which we can easy make a NFA (b) L(ab*a*) intersection L(a*b*a) = L( a+ , ab*a) For which we can easy make a NFA Himanshu Kumar Gupta answered Jul 15, 2020 • edited Aug 3, 2020 by Himanshu Kumar Gupta Himanshu Kumar Gupta comment Share Follow See all 3 Comments See all 3 3 Comments reply Priyadrasta Raut commented Jul 30, 2020 reply Follow Share I think the intersection languages for option b is L(ab*a). 0 votes 0 votes Himanshu Kumar Gupta commented Aug 2, 2020 reply Follow Share then what about single a because single a is also accepted according to option b 0 votes 0 votes Priyadrasta Raut commented Aug 3, 2020 reply Follow Share According to you, ab*a won't acceptable but should be. 0 votes 0 votes Please log in or register to add a comment.