title: How many states would a Turing Machine need to decide this language?
body: <p>The language L = {1^200}, or rather, the language such that there are 200 1's in a row?  Aka, this TM only accepts once it receives 200 '1's in a row.  Would it therefore need 200 states to solve this, or could this be simplified with less states?</p>
  
  <p>I'm asking this to help understand how TM's work.</p>
  
  <p>note: The alphabet would be just {1}.  The TM can use as many tapes as you'd like.</p>