Q3. Design a DFA that accepts all strings over {0, 1} that have 101 as a substring, where k is a substring of w if there
Posted: Thu May 05, 2022 1:03 pm
Q3. Design a DFA that accepts all strings over {0, 1} that have 101 as a substring, where k is a substring of w if there are w1 and w2 such that w = w1 k w2. Q4. Convert the DFA in Q3 above to an equivalent NFA