Question

4. Let be the automaton with the following input set A, state set S and accepting or final ("yes") state set F : A-t, b },s-b"11":2},7-bl } . Suppose s, is the initial state of M , and next state function F of M is given by the table B. Draw the state diagram D D() of the automaton 4 5. Construct the state diagram for the finite-state machine with the state table shown below 6. Construct the state table fo the finite-state machine with the state diagram shown in Figure 1. States0 0.1 Table C 7. Find the output string generated by the finite state machine in Figure 1 if the input string is (i) 000000 11111 101011 (iv) 110101 L (G ), where G 8. Describe the language L has the productions S → aSb. Sb → b4. abd → c

discrete mathematics

Leavening question 4 solve others

Answer 1

つ -^ matine 6 3