About Course

The goal of this course is primarily enabling students to study push down automata and context free grammar. This help us to learn various techniques used in PDA. A pushdown automaton is a way to implement a context-free grammar in a similar way we design DFA for a regular grammar. A DFA can remember a finite amount of information, but a PDA can remember an infinite amount of information. A pushdown automaton has three components an input tape,a control unit, anda stack with infinite size.A PDA may or may not read an input symbol, but it has to read the top of the stack in every transition.

Prerequisites

Basic Knowledge of finite automata,Mathematics, Data Structures and Programming Logic

Outcomes

After completion of this course, the student should be able to:

   1.Explain, Differentiate and manipulate the different concepts in  Push Down Automata

   2.Design Determinstic and Non deterministic Push Down Automata

   3.Describe the language accepted by a turing machine or generated by a Push Down Automata.

   4.Various Concepts of Context Free Grammar and simplifications