FLAT syllabus (Formal Languages and Automata Theory) for JNTUH B.Tech II year II sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.
FLAT Syllabus (Formal Languages and Automata Theory) JNTUH R16
B.Tech. II Year II Sem. L/T/P/C
Course Code: CS404ES 3/0/0/3
Course Objectives:
- To provide introduction to some of the central ideas of theoretical computer science from the perspective of formal languages.
- To introduce the fundamental concepts of formal languages, grammars and automata theory.
- Classify machines by their power to recognize languages.
- Employ finite state machines to solve problems in computing.
- To understand deterministic and non-deterministic machines.
- To understand the differences between decidability and undecidability.
Course Outcomes:
- Able to understand the concept of abstract machines and their power to recognize the languages.
- Able to employ finite state machines for modeling and solving computing problems.
- Able to design context free grammars for formal languages.
- Able to distinguish between decidability and undecidability.
- Able to gain proficiency with mathematical tools and formal methods.
UNIT – I Introduction to Finite Automata, Structural Representations, Automata and Complexity, the
Central Concepts of Automata Theory – Alphabets, Strings, Languages, Problems. Deterministic Finite Automata, Nondeterministic Finite Automata, an application: Text Search, Finite Automata with Epsilon-Transitions.
UNIT – II Regular Expressions, Finite Automata and Regular Expressions, Applications of Regular
Expressions, Algebraic Laws for Regular Expressions, Properties of Regular Languages Pumping Lemma for Regular Languages, Applications of the Pumping Lemma, Closure Properties of Regular Languages, Decision Properties of Regular Languages, Equivalence and Minimization of Automata.
UNIT – III Context-Free Grammars: Definition of Context-Free Grammars, Derivations Using a Grammar, Leftmost and Rightmost Derivations, the Language of a Grammar, Sentential Forms, Parse Tress, Applications of Context-Free Grammars, Ambiguity in Grammars and Languages. Push Down Automata,: Definition of the Pushdown Automaton, the Languages of a PDA, Equivalence of PDA’s and CFG’s, Deterministic Pushdown Automata.
TEXT BOOKS:
- Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.
- Introduction to the Theory of Computation, Michael Sipser, 3rd edition, Cengage Learning.
REFERENCE BOOKS:
- Introduction to Languages and The Theory of Computation, John C Martin, TMH.
- Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
- A Text book on Automata Theory, P. K. Srimani, Nasir S. F. B, Cambridge University Press.
- Introduction to Formal languages Automata Theory and Computation Kamala Krithivasan, Rama R, Pearson.
- Theory of Computer Science – Automata languages and computation, Mishra and Chandrashekaran, 2nd edition, PHI.
For all other B.Tech 2nd Year 2nd Sem syllabus go to JNTUH B.Tech Information Technology 2nd Year 2nd Sem Course Structure for (R16) Batch.
All details and yearly new syllabus will be updated here time to time. Subscribe, like us on facebook and follow us on google plus for all updates.
Do share with friends and in case of questions please feel free drop a comment.