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: Mon May 09, 2022 6:01 am
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.