Have a question that requires me to write the rules for parsing a turing machine
This is the question
The PROBLEM involves writing a set of Turing Machine rules that will read and determine whether or not an input corresponds to the rules of a Turing Machine. This is the ﬁrst step of a Universal Turing Machine. For example, if the input is a legal set of rules, then the machine shall accept this input (and any other legal input that describes a Turing Machine).
The input would be IO = current state with the number of I's indicating what state I = would be the current symbol being true with O being false IIO = next state I = next symbol with O being false I or O = direction with I being left and O being right
so a legal input would be
IOOIIOOI which would be state 1 = current state false = next state 2 = next state false = left
How would I write the rule so that if I ran it through and it detected that the rules did not conform to the legal input it would place II at the beginning of the input and if its correct put OO at the beginning.