title: Prove that the set of regular languages is a proper subset of the set of the context-free languages
body: <p>I was brushing up (not homework)on some computation-theory and came accross this problem:</p>
  
  <p>How can you prove that the set of regular languages is a proper subset of the set of the context-free languages.</p>
  
  <p>Now I know a language is regular iff it is accepted by a finite automaton.</p>
  
  <p>And I know a language is context-free iff it is accepted by a pushdown 
  automaton.</p>
  
  <p>But I'm not sure of what solution is.</p>