Does anyone know how to solve this exercise?
(Edited by Giorgio Satta - original submission Sunday, 5 October 2025, 4:34 AM)
I tried solving it like this; first thing solved the problem of recognising all the strings that begin with 01, after that from q0 I created another state q3 that is reached only if the first bit of the sequence is not a 0 and from that state I basically solved the problem of “finding all the strings that end with 01”. Careful to notice that if q1 is reached you would go directly to q4 if another 0 appears in the sequence. I’m confident its correct but i may be wrong, so if anyone can confirm thank you. Hope it helps have a nice day
I did the same
I solved it in the same way