# JNTUH B.TECH R18 3-1 Syllabus For Formal languages and automata theory PDF 2022

January 6, 2022 2022-01-06 12:26## JNTUH B.TECH R18 3-1 Syllabus For Formal languages and automata theory PDF 2022

# JNTUH B.TECH R18 3-1 Syllabus For Formal languages and automata theory PDF 2022

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

##### Download the APP Now! ( Click Here )

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

#### UNIT – I

Introduction to Finite Automata: Structural Representations, Automata and Complexity, the Central Concepts of Automata Theory – Alphabets, Strings, Languages, Problems.

Nondeterministic Finite Automata: Formal Definition, an application, Text Search, Finite Automata with Epsilon-Transitions.

Deterministic Finite Automata: Definition of DFA, How A DFA Process Strings, The language of DFA, Conversion of NFA with €-transitions to NFA without €-transitions. Conversion of NFA to DFA, Moore and Melay machines

### Formal languages and automata theory Unit Two

#### UNIT – II

Regular Expressions: Finite Automata and Regular Expressions, Applications of Regular Expressions, Algebraic Laws for Regular Expressions, Conversion of Finite Automata to Regular Expressions.

Pumping Lemma for Regular Languages, Statement of the pumping lemma, Applications of the Pumping Lemma.

Closure Properties of Regular Languages: Closure properties of Regular languages, Decision Properties of Regular Languages, Equivalence and Minimization of Automata.

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

##### Download the APP Now! ( Click Here )

### Formal languages and automata theory Unit Three

#### 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, Acceptance by final state, Acceptance by empty stack, Deterministic Pushdown Automata. From CFG to PDA, From PDA to CFG.

### Formal languages and automata theory Unit Four

#### UNIT – IV

Normal Forms for Context- Free Grammars: Eliminating useless symbols, Eliminating €-Productions. Chomsky Normal form Griebech Normal form.

Pumping Lemma for Context-Free Languages: Statement of pumping lemma, Applications

Closure Properties of Context-Free Languages: Closure properties of CFL’s, Decision Properties of CFL’s

Turing Machines: Introduction to Turing Machine, Formal Description, Instantaneous description, The language of a Turing machine

### Formal languages and automata theory Unit Five

#### UNIT – V

Types of Turing machine: Turing machines and halting

Undecidability: Undecidability, A Language that is Not Recursively Enumerable, An Undecidable Problem That is RE, Undecidable Problems about Turing Machines, Recursive languages, Properties of recursive languages, Post’s Correspondence Problem, Modified Post Correspondence problem, Other Undecidable Problems, Counter machines.

### Formal languages and automata theory 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.

### Formal languages and automata theory 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.

### Formal languages and automata theory Text Books

Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Pearson Education.

Theory of Computer Science – Automata languages and computation, Mishra and Chandrashekaran, 2nd edition, PHI.

### Formal languages and automata theory 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 the Theory of Computation, Michael Sipser, 3rd edition, Cengage Learning.

Introduction to Formal languages Automata Theory and Computation Kamala Krithivasan, Rama R, Pearson.

### Scoring Marks in Formal languages and automata theory

Scoring a really good grade in Formal languages and automata theory is a difficult task indeed and CynoHub is here to help!. Please watch the video below and find out how to get 1st rank in your B.tech examinations . This video will also inform students on how to score high grades in Formal languages and automata theory. There are a lot of reasons for getting a bad score in your Formal languages and automata theory exam and this video will help you rectify your mistakes and help you improve your grades.

Information about JNTUH B.Tech R18 Formal languages and automata theory was provided in detail in this article. To know more about the syllabus of other Engineering Subjects of JNTUH check out the official CynoHub application. Click below to download the CynoHub application.