Question

discrete math box answers do A and B please

2. For this problem, all strings are in the set (0,1) a) Design a Finite State Machine that accepts all and only the strings that (start with 0 and end with 1) or (start with 1 and end with 0). E.g. The following strings would be accepted: 010101, 001, 100, 101010, The following strings would not be accepted: 0110, 1010101, 1,0,.. b) Express the set of strings described above as a regular expression

Answer 1

IF YOU HAVE ANY DOUBTS COMMENT BELOW I WILL BE TTHERE TO HELP YOU..ALL THE BEST..

1. We know that the first input is '0' then the last input cannot be '0', so we start two flows form start state, one for staring with '0' and another for starting with '1'
2. So there will be two final states
3. In the first flow starting with '0' we will accept the input '0' on state "q1" for multiple times and then on "1" we will go to final state.
4. On final state we will direct the input '0' to state "q1" so that the last symbol should not be '0'
5. The same mechanism will be for another flow staring from start state "q0" on input '1'.

1 0 0 0 1 1 0 1 0 1

I HOPE YOU UNDERSTAND..

PLS RATE THUMBS UP..ITS HELPS ME ALOT..

THANK YOU...!!