1 votes 1 votes Analogous to the previous exercise, consider all words that can be formed from $L$ by dropping a single symbol of the string. Formally define this operation drop for languages. Construct an nfa for $drop (L)$, given an nfa for $L$. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-expression regular-language + – Naveen Kumar 3 asked Apr 3, 2019 Naveen Kumar 3 299 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
