Question 10
A language machine has left and right input strings. Repeatedly take the last character of the right string and append it to the output, then take the last character of the left string and append it. Stop when at least one input is empty, and append any remaining letters from the other input. The examples show the rule.
What is the output for left COMPE and right TITION?
What is the output for left COMPE and right TITION?