Reference no: EM132125901

Let Σ={a,b}. Give the transition diagram for a nondeterministic ?nite state machine that accepts the set of strings in {a,b}∗ that contain a substring of length four that begins and ends with the same symbol. For example, the string ababbba is accepted because it contains the substring babb but the string abbbaaab is not accepted. The fewer states you use, the more credit you will get for this problem

Not even sure how to go about this. I started trying to just have the beginning of the string be the substring, but then I realized that's not what it means