0 votes 0 votes Find an nfa that accepts the language $L (ab^*aa + bba^*ab)$. 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 178 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Hira Thakur answered Feb 6, 2023 • edited Feb 6, 2023 by Hira Thakur Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.