1 votes 1 votes Construct npda's that accept the following regular languages. (a) $L_1 = L (aaa^*b)$. (b) $L_1 = L (aab^*aba^*)$. (c & d here) Theory of Computation peter-linz peter-linz-edition4 theory-of-computation pushdown-automata npda + – Naveen Kumar 3 asked Apr 20, 2019 Naveen Kumar 3 624 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.