1 votes 1 votes Find an nfa for all strings not containing the substring 101. Use this to derive a regular expression for that language. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation regular-language regular-expression + – Naveen Kumar 3 asked Apr 2, 2019 Naveen Kumar 3 217 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.