Question: Create a method for encoding graphs using only the alphabet symbols { 0, 1 }. Given a graph diagram, you should be able to turn
Create a method for encoding graphs using only the alphabet symbols { 0, 1 }. Given a graph diagram, you should be able to turn it into a string of just 0s and 1s.
You do not have to maintain knowledge of the names of the states in your encoding, if it is easier not to.
You can assume a maximum of 16 states in the graph, if it make the problem easier.
Do not create a Turing machine. Give a a step-by-step process (an algorithm) to follow to turn a graph into a binary number that could be used as the input to a Turing machine.
Give example encodings of the attached graphs A, B, and C using your method.
Does your system guarantee that each graph will have a unique encoding? By unique encoding I mean that each resulting encoding can only be generated by a single graph.
Why would it be a problem if each encoding was not unique?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
