FREE
AKTU Theory of Automata and Formal Languages (BCS402) Syllabus PDF – B.Tech 2nd Year
Theory of Automata and Formal Languages BCS402
All syllabus, notes, question bank & PYQ for this subject
Free
Download now
- English
- Semester 4
- 0 downloads
- 0 views
Official AKTU syllabus of Theory of Automata and Formal Languages (BCS402) for B.Tech 2nd Year – 4 credits, L-T-P 3-1-0. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.
- Computer Science and Engineering › 2nd Year
- Computer Science › 2nd Year
- Computer Engineering › 2nd Year
- Information Technology › 2nd Year
- Computer Science and Information Technology › 2nd Year
- Computer Science and Design › 2nd Year
- Computer Science and Engineering (Artificial Intelligence) › 2nd Year
- Computer Science and Engineering (Artificial Intelligence & Machine Learning) › 2nd Year
- Artificial Intelligence and Machine Learning › 2nd Year
- Artificial Intelligence (AI) and Data Science › 2nd Year
- Computer Science and Engineering (Data Science) › 2nd Year
- Computer Science & Engineering (Cyber Security) › 2nd Year
- Computer Science and Engineering (Internet of Things) › 2nd Year
- Computer Science and Business Systems › 2nd Year
Syllabus — Theory of Automata and Formal Languages
Download PDFBCS402 · 4 credits · L-T-P 3-1-0
Course Outcomes
At the end of course , the student will be able to understand
| CO 1 | Analyse and design finite automata, pushdown automata, Turing machines, formal languages, and grammars | K K 4, 6 |
| CO 2 | Analyse and design, Turing machines, formal languages, and grammars | K K 4, 6 |
| CO 3 | Demonstrate the understanding of key notions, such as algorithm, computability, decidability, and complexity through problem solving | K K 1, 5 |
| CO 4 | Prove the basic results of the Theory of Computation. | K K 2, 3 |
| CO 5 | State and explain the relevance of the Church-Turing thesis. | K K 1, 5 |
Course Content
L-T-P: 3-1-0
| Unit | Topic | Proposed Lecture |
|---|---|---|
| I | Basic Concepts and Automata Theory: Introduction to Theory of Computation- Automata, Computability and Complexity, Alphabet, Symbol, String, Formal Languages, Deterministic Finite Automaton (DFA)- Definition, Representation, Acceptability of a String and Language, Non Deterministic Finite Automaton (NFA), Equivalence of DFA and NFA, NFA with ε-Transition, Equivalence of NFA’s with and without ε-Transition, Finite Automata with output- Moore Machine, Mealy Machine, Equivalence of Moore and Mealy Machine, Minimization of Finite Automata. | 08 |
| II | Regular Expressions and Languages: Regular Expressions, Transition Graph, Kleen’s Theorem, Finite Automata and Regular Expression- Arden’s theorem, Algebraic Method Using Arden’s Theorem, Regular and Non-Regular Languages- Closure properties of Regular Languages, Pigeonhole Principle, Pumping Lemma, Application of Pumping Lemma, Decidability- Decision properties, Finite Automata and Regular Languages | 08 |
| III | Regular and Non-Regular Grammars: Context Free Grammar(CFG)-Definition, Derivations, Languages, Derivation Trees and Ambiguity, Regular Grammars-Right Linear and Left Linear grammars, Conversion of FA into CFG and Regular grammar into FA, Simplification of CFG, Normal Forms- Chomsky Normal Form(CNF), Greibach Normal Form (GNF), Chomsky Hierarchy, Programming problems based on the properties of CFGs. | 08 |
| IV | Push Down Automata and Properties of Context Free Languages: Nondeterministic Pushdown Automata (NPDA)- Definition, Moves, A Language Accepted by NPDA, Deterministic Pushdown Automata(DPDA) and Deterministic Context free Languages(DCFL), Pushdown Automata for Context Free Languages, Context Free grammars for Pushdown Automata, Two stack Pushdown Automata, Pumping Lemma for CFL, Closure properties of CFL, Decision Problems of CFL, Programming problems based on the properties of CFLs. | 08 |
| V | Turing Machines and Recursive Function Theory : Basic Turing Machine Model, Representation of Turing Machines, Language Acceptability of Turing Machines, Techniques for Turing Machine Construction, Modifications of Turing Machine, Turing Machine as Computer of Integer Functions, Universal Turing machine, Linear Bounded Automata, Church’s Thesis, Recursive and Recursively Enumerable language, Halting Problem, Post’s Correspondance Problem, Introduction to Recursive Function Theory. | 08 |
Text Books
- Introduction to Automata theory, Languages and Computation, J.E.Hopcraft, R.Motwani, and Ullman. 2nd edition, Pearson Education Asia
- Introduction to languages and the theory of computation, J Martin, 3rd Edition, Tata McGraw Hill
- Elements and Theory of Computation, C Papadimitrou and C. L. Lewis, PHI
- Mathematical Foundation of Computer Science, Y.N.Singh, New Age Internationa
Ratings & Reviews
No reviews yet — share your experience with this item.