Description
Construct a deterministic one way infinite single tape Turing machine that accepts { (01)n0m2p | n, m, p ≥ 0, m < n, p ≤ n }.
You may not make use of the fact that JFLAP has blank spaces to the left of the input. And you may not use blocks or the stay directive (each transition must either move the read/write head left or right and read a single symbol and write a single symblol) for this Turing machine. And finally, use JFLAP version 7.1.
Since JFLAP does not specifically have a reject state, you can either have a state that your program transitions to that has no exiting transitions or you can simply leave off invalid transitions (transitions that will never get to the accept state), either of which will cause your Turing machine to reject the input.
