title: Proving a Certain Language Regular
body: <p>In my computational theory class we have an assignment of proving a language is regular.
  The language is defined as:</p>
  
  <blockquote>
    <p>B = {<code>1<sup>k</sup>y</code> | <code>y</code> is in <code>{0, 1}*</code> and <code>y</code> contains at least <code>k</code>  1s, for <code>k &gt;= 1</code>}</p>
  </blockquote>
  
  <p>This language looks to me like it would need a pushdown automata to create a machine for this but if someone could push me in the right direction to try and prove this is a regular language.  Showing me one of these ways to prove it: creating a NFA, DFA, regular expression, or regular grammar would be helpful. </p>