Menu

[Solved]Fsa Project Description Assigned Individual Codes Letters B C Also Parity Property Obtain Q37152097

FSA Project description

You have been assigned your own individual codes for the lettersA, B, C and also a “parityproperty”.  
You can obtain your codes and parity property by following the FSAcodes and party property link below.

You are the central hub for a communication system. Messagescome to you as sequences of As, Bs andCs but coded in binary. Each such binary message is to befollowed by a ‘check digit’. This is a final 0 or 1 so that theentire binary message satisfies your parity property.

The parity properties are:

Even 0The entire message (including the check digit) has an evennumber of 0s.Odd 0The entire message (including the check digit) has an oddnumber of 0s.Even 1The entire message (including the check digit) has an evennumber of 1s.Odd 1The entire message (including the check digit) has an oddnumber of 1s.

For example if your codes are A = 101, B =1101, C = 001 and your parity property is Odd 0, themessage ABAC would get encoded as 10111011010011. Thefinal character is the check digit. It is a ‘1’ because we want anodd number of 0s. So 10111011010011 is valid, but 10111011010010and 10111011011100 are not.

Make sure you correctly understand this example before you gofurther. ABAC is 1011101101001. It has 5 0s, so it alreadyhas an odd number of 0s. We have to add a check digit to keep thisnumber odd, so the check digit in this case is 1. If the parityproperty had been Even 0 the check digit would have been 0.

Your task is to design a binary finite stateautomaton (FSA) to accept all strings thatrepresent valid messages (for your particular codes andparity property) and reject all others.
This FSA must be DETERMINISTIC, REDUCED and must be in STANDARDFORM.

FSA codes and parity property Your individual codes and parity property are: PARITY 1101 110 100 Even 1

Submission format is:

Your submission will be marked on-line when you click the submit button. It may take several seconds to process your answer.

FSA codes and parity property Your individual codes and parity property are: PARITY 1101 110 100 Even 1 Your submission will be marked on-line when you click the submit button. It may take several seconds to process your answer. Complete the following table for your answer. It must be a deterministic machine, and state 0 must be the initial state. The form contains sufficient room for up to 30 states. This is many more states than you will need if you do the project using the techniques taught in DMTH237. If you do not use a state, leave the entries blank. Type the number for the state for each transition. Check the tick box if the state is accepting. Leave it unchecked if it is not. Note that while this form accepts machines with implicit black holes – also known as dumping states – (simply leave the transition blank) to help you with testing, a machine in reduced standard form must show any required black hole explicitly as one of the numbered states. This means that a machine with implicit black holes can get at most 6 of the 8 marks. STATE 0 TRANSITION 1 TRANSITION ACCEPTING 3 8 10 ії 12 13 14 Show transcribed image text FSA codes and parity property Your individual codes and parity property are: PARITY 1101 110 100 Even 1
Your submission will be marked on-line when you click the submit button. It may take several seconds to process your answer. Complete the following table for your answer. It must be a deterministic machine, and state 0 must be the initial state. The form contains sufficient room for up to 30 states. This is many more states than you will need if you do the project using the techniques taught in DMTH237. If you do not use a state, leave the entries blank. Type the number for the state for each transition. Check the tick box if the state is accepting. Leave it unchecked if it is not. Note that while this form accepts machines with implicit black holes – also known as dumping states – (simply leave the transition blank) to help you with testing, a machine in reduced standard form must show any required black hole explicitly as one of the numbered states. This means that a machine with implicit black holes can get at most 6 of the 8 marks. STATE 0 TRANSITION 1 TRANSITION ACCEPTING 3 8 10 ії 12 13 14

Expert Answer


Answer to FSA Project description You have been assigned your own individual codes for the letters A, B, C and also a “parity pr… . . .

OR


Leave a Reply

Your email address will not be published. Required fields are marked *