Study material
Engineering
Computer Engineering
Information Technology
Electrical Engineering
Civil Engineering
Mechanical Engineering
Electronics and Communications
Electronics and Telecommunication
Electrical and Electronics
B.Com
B.A
BBA
BAF
BMS
New Test BE-Btech
Demo BE-Btech
Prod BE-BTech
Blog
Log in
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.
Explore Now
Home
Universities
Bihar Engineering University, Bihar
Computer Engineering
Formal Language & Automata Theory
Bihar Engineering University, Bihar, Computer Engineering Semester 5, Formal Language & Automata Theory Syllabus
Formal Language & Automata Theory 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
Unit - 1 Introduction
1.1 Alphabet
1.2 Languages and grammars
1.3 Productions and derivation
1.4 Chomsky hierarchy of languages
1.5 Regular expressions and languages
1.6 Deterministic finite automata DFA and equivalence with regular expressions
1.7 Non deterministic finite automata NFA and equivalence with DFA
1.8 Regular grammars and equivalence with finite automata
1.9 Properties of regular languages
1.10 Pumping lemma for regular languages minimization of finite automata
Unit - 2 Context-free languages and pushdown automata
2.1 Contextfree grammars CFG and Contextfree languages CFL
2.2 Chomsky and Greibach normal forms
2.3 Non deterministic pushdown automata PDA and equivalence with CFG
2.4 Parse trees
2.5 Ambiguity in CFG
2.6 Pumping lemma for contextfree languages
2.7 Deterministic pushdown automata
2.8 Closure properties of CFLs
Unit - 3 Context-sensitive languages
3.1 Contextsensitive grammars CSG and Contextsensitive languages
3.2 Linear bounded automata and equivalence with CSG
Unit - 4 Turing machines
4.1 The basic model for Turing machines TM
4.2 Turing recognizable Recursively enumerable and Turingdecidable recursive languages and their closure properties
4.3 Variants of Turing machines
4.4 Nondeterministic TMs and equivalence with deterministic TMs
4.5 Unrestricted grammars and equivalence with Turing machines
4.6 TMs as enumerators
Unit - 5 Undecidability
5.1 ChurchTuring thesis
5.2 Universal Turing machine
5.3 The universal and diagonalization languages
5.4 Reduction between languages and Rice’s theorem
5.5 Undecidable problems about languages
Download CSE Sem 5 syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Other Subjects of Semester-1
Software engineering
Artificial intelligence
Database management systems
Professional skill development
Popular posts
Top 10 free online resources to learn coding
What is machine learning
What is cloud computing
What is DBMS architecture
Sorting algorithm overview
Share
Link Copied
More than
1 Million
students use Goseeko! Join them to feel the power of smart learning.
Try For Free
Spot anything incorrect?
Contact us