This assignemnt entails coding a sequential state machine from specifications, given an arbitrary characteristic table of a Flip Flop as an input (This characteristic table can have at most four possibilities for outputs - the memory state, the toggle state, 0, or 1 - use any convenient way to encode / input this information.) The Flip Flop may be a hypothetical one also - it is not necessary that it has to be a SR-/RS-, D-, JK-, or a T-Flip Flop alone. (In the State Machine, all Flip Flops are to be of the same type. Further, assume that the Flip Flop can perform the required task. For simplicity, you can also assume that the excitation table for the Flip Flop does not results in outputs such as 0, 1 and 1, 0, or 0,0 and 1,1 - which cannot easily be represented in a don't care-like notation - although handling this case is not really difficult! What does one mean by the above? Look at the excitation table of a JK-Flip Flop, for instance. What is the first row? For Q(t) = 0 and Q(t+1) = 0; J, K = 0, X. This means that J, K = 0, 0 or 0, 1 for this condition.) You may assume that the number of inputs, and the state transition table of the Sequential machine  - are to be given as input by the user. The input and output alphabets are both {0, 1}.For example, if the user wants one input x and one output y, and the following excitation table for the state machine:
        | x = 0   |  x = 1
------+--------+--------
q_0  | q_0, 0  | q_3, 1
q_1  | q_0, 0  | q_2, 0
q_2  | q_1, 1  | q_3, 1
q_3  | q_0, 0  | q_2, 0
------+--------+--------
(Here, q_0 corresponds to A = 0 and B = 0, etc - assume that the Q outputs of the two flip flops required are called A and B, respectively)
(The second and third column in the table are in the form (next state, output). Suppose the user chooses to input a characteristic table, which is the characteristic table of a JK'-Flip Flop.
The program should have the following answer as output:
J_A = x
K_A' = x
J_B = x + A
K_B' = 0
y = xB' + AB'
Note that the final minimized form should come from the output of Assignment 2 (The K-Map assignment), suitably modified to provide the requisite text output.

Suny Dewanand Gedam: sdgedam@ee.iitb.ac.in

02 - 09.00 - 09.20hrs
07 - 09.20 - 09.40hrs
12 - 09.40 - 10.00hrs
13 - 10.00 - 10.20hrs
18 - 10.20 - 10.40hrs
23 - 10.40 - 11.00hrs
28 - 11.00 - 11:20hrs
29 - 11.20 - 11.40hrs
34 - 11.40 - 12.00hrs
39 - 12.00 - 12.20hrs
41 - 12.20 - 12.40hrs

P. L. S. S. S. N. Raju: raju@ee.iitb.ac.in

01 - 09.00 - 09.20hrs
06 - 09.20 - 09.40hrs
11 - 09.40 - 10.00hrs
16 - 10.00 - 10.20hrs
17 - 10.20 - 10.40hrs
22 - 10.40 - 11.00hrs
27 - 11.00 - 11:20hrs
32 - 11.20 - 11.40hrs
33 - 11.40 - 12.00hrs
38 - 12.00 - 12.20hrs

Sapavat Sujatha: sujatha@ee.iitb.ac.in

03 - 09.00 - 09.20hrs
08 - 09.20 - 09.40hrs
09 - 09.40 - 10.00hrs
14 - 10.00 - 10.20hrs
19 - 10.20 - 10.40hrs
24 - 10.40 - 11.00hrs
25 - 11.00 - 11:20hrs
30 - 11.20 - 11.40hrs
35 - 11.40 - 12.00hrs
40 - 12.00 - 12.20hrs

Sridhar Iyengar: sridhar@ee.iitb.ac.in

04 - 09.00 - 09.20hrs
05 - 09.20 - 09.40hrs
10 - 09.40 - 10.00hrs
15 - 10.00 - 10.20hrs
20 - 10.20 - 10.40hrs
21 - 10.40 - 11.00hrs
26 - 11.00 - 11:20hrs
31 - 11.20 - 11.40hrs
36 - 11.40 - 12.00hrs
37 - 12.00 - 12.20hrs
42 - 12.20 - 12.40hrs