Q.2
Parity Checker
A F.S.T. has input alphabet {0, 1}, output alphabet {0, 1} and behaves as
follows:-
If, after inputting the current symbol from the input stream, the total number
of 1's (not necessarily consecutive) input so far is odd, then the machine
outputs a 1; alternatively, if the total number of 1's input so far is
outputs a 0.
(N.B. Mathematically, zero 1's is regarded as an even number of ones).
a)
Draw a State-Transition Diagram for this F.S.T.
b)
Draw up a State-Transition Table and an Output Table for this F.S.T.
A F.S.T., for which the input alphabet is {0, 1} and the output alphabet is {0, 1},
behaves as follows:-
it usually outputs a 0. However fau
even, it