0 votes 0 votes Let $L$ be the language accepted by the nfa in the following figure: Find an nfa that accepts $L$ $∪$ {$a^5$} . Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata + – Naveen Kumar 3 asked Mar 22, 2019 Naveen Kumar 3 413 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.