sc JNTUK B.TECH R20 2-2 Syllabus For Formal languages and automata theory PDF 2022 – Cynohub

# JNTUK B.TECH R20 2-2 Syllabus For Formal languages and automata theory PDF 2022

### Get Complete Lecture Notes for Formal languages and automata theory on Cynohub APP

You will be able to find information about Formal languages and automata theory along with its Course Objectives and Course outcomes and also a list of textbook and reference books in this blog.You will get to learn a lot of new stuff and resolve a lot of questions you may have regarding Formal languages and automata theory after reading this blog. Formal languages and automata theory has 5 units altogether and you will be able to find notes for every unit on the CynoHub app. Formal languages and automata theory can be learnt easily as long as you have a well planned study schedule and practice all the previous question papers, which are also available on the CynoHub app.

All of the Topic and subtopics related to Formal languages and automata theory are mentioned below in detail. If you are having a hard time understanding Formal languages and automata theory or any other Engineering Subject of any semester or year then please watch the video lectures on the official CynoHub app as it has detailed explanations of each and every topic making your engineering experience easy and fun.

### Formal languages and automata theory Unit One

Finite Automata: Need of Automata theory, Central Concepts of Automata Theory, Automation, Finite Automation, Transition Systems, Acceptance of a String, DFA, Design of DFAs, NFA, Design of NFA, Equivalence of DFA and NFA, Conversion of NFA into DFA, Finite Automata with Є-Transitions, Minimization of Finite Automata, Finite Automata with output-Mealy and Moore Machines, Applications and Limitation of Finite Automata.

### Formal languages and automata theory Unit Two

Regular Expressions, Regular Sets, Identity Rules, Equivalence of two RE, Manipulations of REs, Finite Automata and Regular Expressions, Inter Conversion, Equivalence between FA and RE, Pumping Lemma of Regular Sets, Closure Properties of Regular Sets, Grammars, Classification of Grammars, Chomsky Hierarchy Theorem, Right and Left Linear Regular Grammars, Equivalence between RG and FA, Inter Conversion.

### Formal languages and automata theory Unit Three

Formal Languages, Context Free Grammar, Leftmost and Rightmost Derivations, Parse Trees, Ambiguous Grammars, Simplification of Context Free Grammars-Elimination of Useless Symbols, Є-Productions and Unit Productions, Normal Forms-Chomsky Normal

Form and Greibach Normal Form, Pumping Lemma, Closure Properties, Applications of Context Free Grammars.

### Formal languages and automata theory Unit Four

Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description, Language Acceptance of Pushdown Automata, Design of Pushdown Automata, Deterministic and Non – Deterministic Pushdown Automata, Equivalence of Pushdown Automata and Context Free Grammars, Conversion, Two Stack Pushdown Automata, Application of Pushdown Automata.

### Formal languages and automata theory Unit Five

Turning Machine: Definition, Model, Representation of TMs-Instantaneous Descriptions, Transition Tables and Transition Diagrams, Language of a TM, Design of TMs, Types of TMs, Church’s Thesis, Universal and Restricted TM, Decidable and Un-decidable Problems, Halting Problem of TMs, Post’s Correspondence Problem, Modified PCP, Classes of P and NP, NP-Hard and NP-Complete Problems.

### Formal languages and automata theory Course Objectives

To learn fundamentals of Regular and Context Free Grammars and Languages

To understand the relation between Regular Language and Finite Automata and machines

To learn how to design Automata’s and machines as Acceptors, Verifiers and Translators

To understand the relation between Contexts free Languages, PDA and TM

To learn how to design PDA as acceptor and TM as Calculators

### Formal languages and automata theory Course Outcomes

By the end of the course students can

Classify machines by their power to recognize languages.

Summarize language classes & grammars relationship among them with the help of Chomsky hierarchy

Employ finite state machines to solve problems in computing

Illustrate deterministic and non-deterministic machines

Quote the hierarchy of problems arising in the computer science

### Formal languages and automata theory Text Books

Introduction to Automata Theory, Languages and Computation, J. E. Hopcroft, R. Motwani and J. D. Ullman, 3rd Edition, Pearson, 2008

Theory of Computer Science-Automata, Languages and Computation, K. L. P. Mishra and N. Chandrasekharan, 3rd Edition, PHI, 2007

### Formal languages and automata theory Reference Books

Elements of Theory of Computation, Lewis H.P. & Papadimition C.H., Pearson /PHI

Theory of Computation, V. Kulkarni, Oxford University Press, 2013

Theory of Automata, Languages and Computation, Rajendra Kumar, McGraw Hill, 2014