CS402 Theory of Automata GDB Solution & Discussion Spring 2011

In formal language theory, a context free language is a language generated by some boctext free grammar.  The set of all context free languages is identicla ot the set of languages accepted by puhdown automata.

Properties of context-free languages

• Every regular language is context-free because it can be described by a regular grammar.
• The intersection of a context-free language and a regular language is always context-free.
• There exist context sensitive languages which are not context-free.

So we can say by above properties that:

“Context Free Languages set also contains Regular Languages set”