Scribd
Upload
4 views

TOC Syllabus (1)

The document outlines the course details for 'Theory of Computation' (UCS2004) offered in the 4th semester for the batch 2023-27, focusing on core theoretical concepts. Students will learn about finite state machines, pushdown automata, and Turing machines, along with their applications and properties. Prerequisites include a basic understanding of discrete mathematics, and various textbooks and web resources are provided for further study.

Uploaded by

nom95981
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views

TOC Syllabus (1)

The document outlines the course details for 'Theory of Computation' (UCS2004) offered in the 4th semester for the batch 2023-27, focusing on core theoretical concepts. Students will learn about finite state machines, pushdown automata, and Turing machines, along with their applications and properties. Prerequisites include a basic understanding of discrete mathematics, and various textbooks and web resources are provided for further study.

Uploaded by

nom95981
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Course Category: Core Theory

Course Name: Theory of


Computation Course Code:
UCS2004
L-T-P: 3-0-0
Semester: 4th
Batch: 2023-27

Prerequisite:
The students should have the understanding of:
● Basic of discrete mathematics.

Course Outcomes:
At the end of the course students will be:
CO1 - Familiar with the basics concepts in theory of computation;
CO2 - Able to construct finite state machines and the equivalent regular expressions.
CO3 - Able to construct pushdown automata and their equivalent context free
grammers. CO4 - Exposed to the advanced concepts of theory of automata
computation.

Unit Topics CO No. of Proposed


No. No. Lectures
Finite Automata and Regular Expressions: Finite
1 State Systems, Basic Definitions Non-Deterministic 1 10
finite automata (NDFA), Deterministic finite
automata (DFA), Conversion of NFA to DFA Finite
automata with E-moves, Regular Expressions,
Equivalence of finite automata and Regular
Expressions, state and prove Arden’s Method..
Introduction to Machines: Concept of basic
Machine, Properties and limitations of FSM. Moore
and mealy
Machines, Equivalence of Moore and Mealy
machines.

Properties of Regular Sets: The Pumping Lemma


2 for Regular Sets, Applications of the pumping 2 12
lemma, Closure properties of regular sets, Myhill-
Nerode Theorem and minimization of finite
Automata, Minimization Algorithm.
Grammars: Definition, Context free and Context
sensitive grammar, Ambiguity in grammars,
Reduced forms, Removal of useless Symbols, unit
production and null production Chomsky Normal
Form (CNF),
Griebach Normal Form (GNF).
Pushdown Automata: Introduction to Pushdown
3 3 10
Machines, Deterministic Push Down Automata
(DPDA) and Non-Deterministic Push Down
Automata (NPDA) Application of Pushdown
Machines
Turing Machines: Deterministic and Non-
Deterministic Turing Machines, Design of T.M,
Halting problem of T.M., PCP Problem.
Chomsky Hierarchies: Chomsky hierarchies of
4 grammars, Unrestricted grammars, Context sensitive 4 8
languages, Relation between languages of classes.
Computability: Basic concepts, Primitive
Recursive
Functions.

Text Books:

1. Theory of Computer Science (Automata, Languages and computation):K.L.P.Mishra


& N.Chandrasekaran, 2000, PHI.
2. Introduction to automata theory, language & computation- Hopcroaft & O.D.Ullman,
R Mothwani.

Reference Books:

1. Introduction to formal Languages & Automata-Peter Linz, 2001, Narosa Publication.


2. Fundamentals of the Theory of Computation- Principles and Practice by Ramond Greenlaw and
H. James Hoover, Harcourt India Pvt. Ltd.
3. Elements of theory of Computation by H.R. Lewis & C.H. Papaditriou, PHI.
4. Introduction to languages and the Theory of Computation by John C. Martin 2003, T.M.H

Web References:
“Theory of Computation”: https://onlinecourses.nptel.ac.in/noc21_cs19/preview

You might also like