0 votes 0 votes Find dfa's that accept the following languages. (a) $L (aa^* + aba^*b^*)$. (b) $L (ab (a + ab)^* (a + aa))$. (c) $L ((abab)^* + (aaa^* + b)^*)$. (d) $L (((aa^*)^* b)^*)$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-expression regular-language + – Naveen Kumar 3 asked Apr 2, 2019 Naveen Kumar 3 244 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.