MNIT Jaipur Syllabus computer science Formal Languages and Automata Theory

MNIT Jaipur Syllabus computer science Formal Languages and Automata Theory  

 

 

Formal Languages and Automata Theory

Introduction to formal languages and their operations, abstract machines.

Finite automata and regular expressions, Non-deterministic finite automata, Mealy and Moore machines,

minimization of finite automata, Pumping lemma for regular languages.

Chomsky classification of languages, regular grammars, context free grammars, simplification of contextfree grammars, Normal forms of context free grammars.

Push Down Automata Theory: Push down automata and context free languages, Pumping lemma for

context free languages.

Turing hypothesis, Turing machine, Minskey’s theorem, TM variation and encoding, computability and

acceptability.

Text/ References:

1. Hopcroft, Motwani and Ullman: Introduction to Automata Theory, Languages and Computation,

Pearson Education.

2. Cohen:  Introduction to Computer Theory, Addison Wesley.

3. Martin:  Introduction to Languages and Theory of Computation, TMH.

Leave a Comment