Scribd
Upload
4 views

syllabus

The course 'Automata Theory and Computability' (CSET302) is a core B.Tech. course effective from July–Dec 2024, focusing on Chomsky hierarchy, languages, and machine design. Students will learn to develop mathematical models for real-life problems and examine computational complexity. The course includes a detailed syllabus covering finite automata, context-free grammars, Turing machines, and computational complexity, with various teaching strategies and evaluation components.

Uploaded by

Arjun Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views

syllabus

The course 'Automata Theory and Computability' (CSET302) is a core B.Tech. course effective from July–Dec 2024, focusing on Chomsky hierarchy, languages, and machine design. Students will learn to develop mathematical models for real-life problems and examine computational complexity. The course includes a detailed syllabus covering finite automata, context-free grammars, Turing machines, and computational complexity, with various teaching strategies and evaluation components.

Uploaded by

Arjun Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

COURSE CONTEXT

VERSION NO. OF
CURRICULUM/SYLLABUS
SCHOOL SCSET THAT THIS COURSE IS A V1
PART OF
DATE THIS COURSE
DEPARTMENT WILL BE EFFECTIVE July–Dec,2024
FROM
VERSION NUMBER OF
DEGREE B.Tech. THIS COURSE 2

COURSE BRIEF
Automata Theory and
COURSE TITLE Computability PRE-REQUISITES NA
COURSE CODE CSET302 TOTAL CREDITS 4
COURSE TYPE Core L-T-P FORMAT 3-1-0

COURSE SUMMARY
This course is to articulate Chomsky hierarchy, and different languages and grammars. In this
course students learn to design machines and develop efficient mathematical models for real-
life problems. Further, this course is about to examine computational cost and complexity for
computer-based problems.

COURSE-SPECIFIC LEARNING OUTCOMES (CO)


By the end of this program, students should have the following knowledge, skills, and values:
CO1: To articulate Chomsky hierarchy, and different languages and grammars.
CO2: To design machines and develop efficient mathematical models for real-life problems.
CO3: To examine computational cost and complexity for computer-based problems.

How are the above COs aligned with the Program-Specific Objectives (POs) of the degree?
The course outcomes are aligned to inculcating inquisitiveness in understanding cutting edge
areas of computer science engineering and allied disciplines with their potential impacts.

How are the above COs aligned with the Program-Specific Objectives (POs) of the degree?
The course outcomes are aligned to inculcating inquisitiveness in understanding cutting
edge areas of computer science engineering and allied disciplines with their potential
impacts.
Detailed Syllabus
Module 1 (12 hours)
Introduction, Sets, Relation, and Functions, Mathematical Logics, Formal Languages,
Language Classification, Finite Automata: Finite State Machine, DFA, NFA, epsilon-NFA,
Equivalence between NFA to DFA, Equivalence between epsilon-NFA to DFA, Minimization
of DFA, Regular Language, Regular Expression, Regular Expression to Finite Automata,
Finite Automata to Regular Expression, Arden’s Theorem, State Elimination Method, Pumping
Lemma, Closure Properties of Regular Languages, Decision Properties of Regular Languages,
Finite Automata with Output, Mealy Machine, Moore Machine, Equivalence between Mealy
and Moore Machine, Properties and Limitation of FSM.

Module 2 (9 hours)
Context Free Grammar, Context Free Language, Regular Grammar, Left and Right Associative
Grammar, Left Derivation and Right Derivation, Removal of Ambiguity in Grammar,
Normalization of Grammar, CNF, GNF, Deterministic Push Down Automata, Non-
Deterministic Push Down Automata, Comparison between DPDA and NPDA, Pumping
Lemma for CFG, Closure Properties of CFG, Context Sensitive Grammar.

Module 3 (11 hours)


Turing Machine: Definition and Design, Church-Turing Thesis, State Transition Diagram for
Turing Machine, Un-restricted Grammar, Universal Turing Machine, Combining Turing
Machines, Variations of Turing Machine, Multi stack PDA, Multi-tape TMs, Single sided
infinite tape TMs, Non-deterministic TMs, Multi-head TMs, Post Correspondence Problem,
Halting Problem, Enumerability of TMs, Acceptability of TMs, Decidability of TMs, Rice
Theorem, Chomsky Hierarchy, Diagonalization.
Module 4 (10 hours)
Computational Complexity: The concept of a reduction, P, NP, and NP-completeness, NP-Hardness,
The Cook-Levin Theorem, Space Complexity Classes (PSPACE and NPSPACE), Probabilistic State
Automaton, Markov Chain Model, Probabilistic Turing machine, Cellular Automata, Quantum
Computing

TEXTBOOKS/LEARNING RESOURCES:
1. Peter Linz, An Introduction to Formal Languages and Automata (6th ed.), Jones &
Bartlett Learning, 2016. ISBN 9781284077247.
2. BIKASH KANTI SARKAR and AMBUJ KUMAR, INTRODUCTION TO
THEORY OF COMPUTATION (1st ed.), The Orient Blackswan, 2019. ISBN
9789386235757.
REFERENCE BOOKS/LEARNING RESOURCES:
1. Avi Wigderson, Mathematics and Computation A Theory Revolutionizing Technology and
Science
(1st ed.), Princeton University Press, 2019. ISBN 978-0691189130.

TEACHING-LEARNING STRATEGIES
The course will be taught using a combination of the best practices of teaching-learning.
Multiple environments will be used to enhance the outcomes such as seminar, self-learning,
MOOCs, group discussions and ICT based tools for class participation along with the
classroom sessions. The teaching pedagogy being followed includes more exposure to hands-
on experiment and practical implementations done in the lab sessions. To match with the latest
trend in academics, case study, advanced topics and research-oriented topics are covered to lay
down the foundation and develop the interest in the students leading to further exploration of
the related topics. To make the students aware of the industry trends, one session of expert
lecture will be organized to provide a platform to the students for understanding the relevant
industry needs.

EVALUATION POLICY

Components of Course Evaluation Percentage Distribution

End Semester Examination 40%

Certification 10%

Continuous Evaluation 20%

Mid Term Examination 20%

Quiz 10%

Total 100%

You might also like