Consider the finite state machine described by the following state transition diagram. Σ = {0,1},∆ = {00,01,10,11}
M=({A,B,C},{0,1},{00,01,10,11},δ,λ,A)
(Note: Assume that there is an extra 0 attached at the left most end of the string. For example, if the string is 100, we consider it as 0100.)
Identify the correct statement.
- None of the above.
- Outputs 10 whenever the input sequence contains 01.
- Outputs the concatenation of present and previous bits in the input string.
- Outputs 00 whenever the input sequence contains 10.