Clarification for a class of Turing machine problems So say I have a task like this:


  Construct a Turing machine transforming the word u to the word v byt
  removing all the sequences of form "ba" from the word u. Input
  alphabet = {a,b,c}. 
  
  Example: for IN cabbaacba, OUT cac.


And my problem always is: can I leave blank characters in place of "ba" sequences in tasks like this so that in the end, I have something like $ca \Phi \Phi \Phi \Phi c \Phi \Phi$ on the tape or do I have to work on the tape in such a way that I end up with, for example "cac", written consecutively, without blanks?
The question does not mention replacing "ba" by spaces.     It does not say that you can have spaces between the symbols in the output word. Is the blank character even in the output language?