Hi, i was trying to write a FSA that recognizes the set of all bit strings that contain the string 101. Could this implementation be considered a correct one?
Thanks a lot
Hi, i was trying to write a FSA that recognizes the set of all bit strings that contain the string 101. Could this implementation be considered a correct one?
Thanks a lot
Here is a diagram of an FSA that I think does the job. On the arrow going from S2 back to S0 there should be a label of $0$ but now tht diagram is there I can't edit the diagram.