Task: Design a Turing Machine with alphabet LaTeX: \Sigma = {\triangleright, \sqcup, A, B}Σ = { ▹ , ⊔ , A , B } that when given as input a finite sequence of A's and B's checks to see if all the A's appear to the left of all the B's. The machine should leave the input string on the tape, and either halt if the string is "alphabetical", or loop forever if it is not.
Once you have designed your Turing Machine I want you to implement it in https://turingmachinesimulator.com/ (Links to an external site.) and submit the machine specification which I'll need to paste into the box there to compile your machine.
To get an idea of the kind of submission I'm after, have a look at the sample Turing Machine Simulator input files I've uploaded to canvas like this one: Adder.txtPreview the document