Assignment 3

Topic: State Minimization

Due on or before: Saturday March 25, 2006 (and Wednesday March 29 for Groups with Sujatha: but code to be e-mailed by Saturday March 25 midnight)

Maximum Marks: 6

This assignment entails an implementation of a State Minimization algorithm for Mealy Machines, using the k-Equivalence / Successive Partitioning  technique (done in class). You can let the user has specify the number of states,  the input and output alphabet, and based on  the above, the state transition and output tables. You should not assume the alphabets to be hard-coded to {0, 1}. You may however, assume the machine to have one input line and one output line.

Venues and Group Assignments to TAs:
Venue: PC Lab, Ist Floor, EE Department (Ph. 4429)

Suny Dewanand Gedam: sdgedam@ee.iitb.ac.in
04 - 10.10 - 10.30hrs
05 - 10.30 - 10.50hrs
10 - 10.50 - 11.10hrs
15 - 11.10 - 11.30hrs
20 - 11.30 - 11.50hrs
21 - 11.50 - 12.10hrs
26 - 12.10 - 12:30hrs
31 - 12.30 - 12.50hrs
36 - 12.50 - 13.10hrs
37 - 13.10 - 13.30hrs
42 - 13.30 - 13.50hrs

P. L. S. S. S. N. Raju: raju@ee.iitb.ac.in
03 - 10.10 - 10.30hrs
08 - 10.30 - 10.50hrs
09 - 10.50 - 11.10hrs
14 - 11.10 - 11.30hrs
19 - 11.30 - 11.50hrs
24 - 11.50 - 12.10hrs
25 - 12.10 - 12:30hrs
30 - 12.30 - 12.50hrs
35 - 12.50 - 13.10hrs
40 - 13.10 - 13.30hrs

Sapavat Sujatha: sujatha@ee.iitb.ac.in
Wednesday March 29, 2006
========================
01 - 18.00 - 18.20hrs
06 - 18.20 - 18.40hrs
11 - 18.40 - 19.00hrs
16 - 19.00 - 19.20hrs
17 - 19.20 - 19.40hrs
22 - 19.40 - 20.00hrs
27 - 21.20 - 21:40hrs
32 - 21.40 - 22.00hrs
33 - 22.00 - 22.20hrs
38 - 22.20 - 22.40hrs

Sridhar Iyengar: sridhar@ee.iitb.ac.in
02 - 10.10 - 10.30hrs
07 - 10.30 - 10.50hrs
12 - 10.50 - 11.10hrs
13 - 11.10 - 11.30hrs
18 - 11.30 - 11.50hrs
23 - 11.50 - 12.10hrs
28 - 12.10 - 12:30hrs
29 - 12.30 - 12.50hrs
34 - 12.50 - 13.10hrs
39 - 13.10 - 13.30hrs
41 - 13.30 - 13.50hrs


 

Sumantra Dutta Roy  Department of Electrical Engineering, IIT Bombay, Powai,
Mumbai - 400 076, INDIA. sumantra@ee.iitb.ac.in