Become a data analyst in the next 4 months and kickstart your career. 100% placement assistance. Start your Analytics journey with our free Python course.
Dr A.P.J. Abdul Kalam Technical University, UP (AKTU), Computer Engineering Semester 4, Theory of Automata and Formal Languages Syllabus
Theory of Automata and Formal Languages Lecture notes | Videos | Free pdf Download | Previous years solved question papers | MCQs | Question Banks| Syllabus
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Try Now for free
Unit - 1 Basic Concepts and Automata Theory
Unit 1
Basic Concepts and Automata Theory
1.1 Introduction to theory of computation
1.2 Deterministic finite automation DFA
1.3 NonDeterministic Finite Automation NFA
1.4 Equivalence of DFA and NFA
1.5 NFA with εTransition
1.6 Equivalence of NFA’s with and without εTransition
1.7 Finite Automata with output
1.5 Minimization of Finite Automata
1.6 Myhill Nerode Theorem
1.7 Simulation of DFA and NFA
Unit - 2 Regular Expressions and Languages
Unit 2
Regular Expressions and Languages
2.1 Regular Expressions
2.2 Transition Graph
2.3 Kleen’s Theorem
2.4 Finite Automata and Regular Expression
2.5 Regular and NonRegular Languages
2.6 Pigeonhole Principle
2.7 Pumping Lemma
2.8 Finite Automata and Regular Languages
2.9 Regular Languages and Computers
2.10 Simulation of Transition Graph and Regular language
Unit - 3 Regular and Non-Regular Grammars
Unit – 3
Regular and NonRegular Grammar
3.1 Context free Grammar CFG
3.2 Regular grammars
3.3 Conversion of FA into CFG and Regular grammar into FA
3.4 Simplification of CFG
3.5 Normal Forms
3.6 Programming problems based on the properties of CFGs
Unit - 4 Push Down Automata and Properties of Context Free Languages
Unit – 4
Push Down Automata and Properties of Context Free Languages
4.1 Nondeterministic Pushdown Automata NPDA
4.2 Deterministic Pushdown Automata DPDA and Deterministic Context free Languages DCFL
4.3 Pushdown Automata for Context Free Languages
4.4 Context Free grammars for Pushdown Automata
4.5 Two stack Pushdown Automata
4.6 Pumping Lemma for CFL
4.7 Closure properties of CFL
4.8 Decision Problems of CFL
4.9 Programming problems based on the properties of CFLs
Unit - 5 Turing Machines and Recursive Function Theory
Unit – 5
Turing Machines and Recursive Function Theory
5.1 Basic Turing Machine Model
5.2 Linear Bounded Automata
5.3 Church’s Thesis
5.4 Recursive and Recursively Enumerable language
5.5 Halting Problem
5.6 Post’s Correspondence Problem
5.7 Introduction to Recursive Function Theory
Download CSE Sem 4 syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Try Now for free
Other Subjects of Semester-2
Share
Link Copied
More than 1 Million students use Goseeko! Join them to feel the power of smart learning.
Spot anything incorrect? Contact us
Goseeko covers the entire spectrum of student’s journey from Academics to Career. From helping them to ace their academics with our personalized study material to providing them with career development resources, our students meet their academic and professional goals.
Courses
B.E.
B.Com
B.A.
BBA
BMS
BSC
Resources
Notes
MCQ
Question bank
Audio bites
Express Class
Reference Videos
Solved Question Papers
