ITC405: Automata Theory Syllabus for IT 4th Sem 2017 Pattern Mumbai University

Automata Theory detailed syllabus scheme for Information Technology (IT), 2017 regulation has been taken from the University of Mumbai official website and presented for the Bachelor of Engineering students. For Course Code, Course Title, Test 1, Test 2, Avg, End Sem Exam, Team Work, Practical, Oral, Total, and other information, do visit full semester subjects post given below.

For all other Mumbai University Information Technology 4th Sem Syllabus 2017 Pattern, do visit IT 4th Sem 2017 Pattern Scheme. The detailed syllabus scheme for automata theory is as follows.

Automata Theory Syllabus for Information Technology SE 4th Sem 2017 Pattern Mumbai University

Course Objectives:

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 pdf platform to make students’s lives easier.
.

Course Outcomes:

The students will be able to:

1. Understand, design, construct, analyze and interpret Regular languages, Expression and Grammars.
2. Design different types of Finite Automata and Machines as Acceptor, Verifier and Translator.
3. Understand, design, analyze and interpret Context Free languages, Expression and Grammars.
4. Design different types of Push down Automata as Simple Parser.
5. Design different types of Turing Machines as Acceptor, Verifier, Translator and Basic computing machine.
6. Compare, understand and analyze different languages, grammars, Automata and Machines and appreciate their power and convert Automata to Programs and Functions

Prerequisites:

Basic Mathematical Fundamentals: Sets, Logic, Relations, Functions.

Module I

Introduction and Regular Languages: Alphabets and Strings. Regular Languages: Regular Expressions, Regular Languages, Regular Grammars, RL and LL 06 CO1 Languages grammars, Closure properties

Module II

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 pdf platform to make students’s lives easier.
.

Module III

Context Free Grammars Context Free Languages: CFG, Leftmost and Rightmost derivations, Ambiguity, Simplification and Normalization ( CNF) and Chomskey Hierarchy ( Types 0 to

1. 08 CO3

Module IV

Push Down Automata Push Down Automata: Deterministic ( single stack )PDA, Equivalence between PDA and CFG. 05 CO4

Module V

Turing Machine Turing Machine: Deterministic TM , Multi-track and Multi-tape TMs, concept of UTM and idea of system program. Issue and concept of Halting Problem 07 CO5

Module VI

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 pdf platform to make students’s lives easier.
.

Text Books:

1. J.C.Martin, Introduction to languages and the Theory of Computation, TMH.
2. Kavi Mahesh, Theory of Computation A Problem Solving Approach, Wiley India

Reference Books:

1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, Pearson Education.
2. Daniel I.A. Cohen, Introduction to Computer Theory, John Wiley & Sons.
3. Theory of Computation – By Vivek Kulkarni from Oxford University.
4. N.Chandrashekhar& K.L.P. Mishra, Theory of Computer Science, Automata Languages & Computations, PHI publications.

Suggested Tutorials:

1. Introduction and Regular Languages 1 Tutorial on design of RE, RG, RLG and LLG for given Regular Language.
2. Finite Automata and machines 3 Tutorials for converting RE to NFA, NFA to DFA to Reduced DFA, FA to RE. 1 Tutorial on design of Moore and Mealy machines.
3. Context Free Grammars 1 Tutorial on design of CFG and Leftmost and Rightmost derivations. 1 Tutorial for converting CFG to CNF.
4. Push Down Automata 1 Tutorial on design of Push Down Automata.
5. Turing Machine 1 Tutorial on design of single tape Turing Machine. 1 Tutorial on design of Multi-track and Multi-tape TMs.
6. Applications of Automata 2 Tutorials for converting Automata to Functions:
   1. FA to Acceptor / Verifier.
   2. FSM to Translator.
   3. PDA to Simple Parser for WF parenthesis, palindromes etc.
   4. TM to Basic bit wise calculator(+ /- /AND/OR) / Translator

Assessment:

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 pdf platform to make students’s lives easier.
.

For detail syllabus of all other subjects of Information Technology (IT) 4th Sem 2017 regulation, visit IT 4th Sem Subjects syllabus for 2017 regulation.