Theory of Automata and Formal Languages detail syllabus for Computer Science & Artificial Intelligence (CSAI), 2021-22 scheme is taken from AKTUs official website and presented for the AKTU B.Tech students. For the course code (KCS402), exam duration, teaching hr/week, practical hr/week, total marks, internal marks, theory marks, duration, credits, and other details do visit complete semester subjects post given below.
For all other csai 4th sem syllabus for aktu b.tech 2021-22 scheme you can visit CSAI 4th Sem Syllabus for 2021-22 regulation. The detail syllabus for theory of automata and formal languages is as follows.
Course Outcomes:
For the complete syllabus, results, class timetable and more kindly download iStudy. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.
Unit 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 s-Transition, Equivalence of NFA’s with and without s-Transition, Finite Automata with output- Moore Machine, Mealy Machine, Equivalence of Moore and Mealy Machine, Minimization of Finite Automata, Myhill-Nerode Theorem, Simulation of DFA and NFA
Unit II
For the complete syllabus, results, class timetable and more kindly download iStudy. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.
Unit 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.
Unit IV
For the complete syllabus, results, class timetable and more kindly download iStudy. It’s a lightweight, easy to use, no images, no pdfs platform to make student’s life easier.
Unit 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.
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
For detail syllabus of all other subjects of B.Tech CSAI, 2021-22 scheme do visit CSAI 4th Sem syllabus for 2021-22 scheme.
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.