DMTH237 Session 1, 2013
FSA PROJECT DESCRIPTION
Submission deadline is precisely 10:00pm on Monday 29 April, 2013. Submissions after this time will have a late penalty applied.*
You have been assigned your own individual codes for the letters A, B, C and also a “parity property”.
My code and parity properties are:CODE
A: 00000
B: 1010
C: 010
PARITY: Even 1

You are the central hub for a communication system. Messages come to you as sequences of As, Bs and Cs but coded in binary. Each such binary message is to be followed by a “check digit”. This is a final 0 or 1 so that the entire binary message satisfies your parity property.
The parity properties are:
EVEN 0 The entire message (including the check digit) has an even number of 0’s. ODD 0 The entire message (including the check digit) has an odd number of 0’s. EVEN 1 The entire message (including the check digit) has an even number of 1’s. ODD 1 The entire message (including the check digit) has an odd number of 1’s. For example if your codes are A = 101, B = 1101, C = 001 and your parity property is Odd0, the message ABAC would get encoded as 10111011010011. The final character is the check digit. It is a ‘1’ because we want an odd number of 0s. So 10111011010011 is valid, but 10111011010010 and 10111011011100 are not. Make sure you correctly understand this example before you go further. ABAC is 1011101101001. It has 5 0s, so it already has an odd number of 0s. We have to add a check digit to keep this number odd, so the check digit in this case is 1. If the parity property had been Even0 the check digit would have been 0.
Your task is to design a binary finite state automaton (FSA) to accept all strings that represent valid messages (for your particular codes and parity property) and reject all others. This FSA must be DETERMINISTIC, REDUCED and must be in STANDARD FORM.
This project is machine marked. You can submit your attempts as many times as you like and your submission will be marked…