1. Define Regular Languages and Regular Operations:
2. Define pumping Leema:
3. How can we use the Pumping Lemma to proof that a language is NOT regular?
4. What is the Formal definition of CFG Context Free Grammar?
5. Define the differences between a DFA Deterministic Finite Automata and a PUSH DOWN Automaton.
