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