Scribd
Upload
39 views

Department of Computer Science & Engineering and Information Technology Theory of Computation 150503 (DC-10) Course Objective

This document outlines the course objectives, units, recommended books, and outcomes for a Theory of Computation course. The course objectives are to understand computability, decidability, complexity through problem solving, analyze models of computation and formal languages, and conduct mathematical proofs for computation and algorithms. The five units cover topics like finite automata, regular expressions, grammars, pushdown automata, and Turing machines. Upon completing the course, students will be able to explain concepts of automata theory and languages, relate problems to theoretical models, construct and analyze abstract computing models, and apply formal methods to analyze languages, grammars and automata.

Uploaded by

Naman Sahu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
39 views

Department of Computer Science & Engineering and Information Technology Theory of Computation 150503 (DC-10) Course Objective

This document outlines the course objectives, units, recommended books, and outcomes for a Theory of Computation course. The course objectives are to understand computability, decidability, complexity through problem solving, analyze models of computation and formal languages, and conduct mathematical proofs for computation and algorithms. The five units cover topics like finite automata, regular expressions, grammars, pushdown automata, and Turing machines. Upon completing the course, students will be able to explain concepts of automata theory and languages, relate problems to theoretical models, construct and analyze abstract computing models, and apply formal methods to analyze languages, grammars and automata.

Uploaded by

Naman Sahu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MADHAV INSTITUTE OF TECHNOLOGY AND SCIENCE, GWALIOR – 474005

(A Govt. Aided UGC Autonomous Institute Affiliated to R.G.P.V. Bhopal, M.P.)

Department of Computer Science & Engineering and Information Technology


THEORY OF COMPUTATION
160503 / 150503 (DC-10)

COURSE OBJECTIVE
 To understand computability, decidability, and complexity through problem solving.
 To analyse and design abstract model of computation & formal languages
 To understand and conduct mathematical proofs for computation and algorithms.
------------------------------------------------------------------------------------------------

Unit-I
Introduction of Automata Theory: Examples of automata machines, Finite Automata
as a language acceptor and translator, Moore machines and mealy machines, composite
machine, Conversion from Mealy to Moore and vice versa.

Unit-II
Types of Finite Automata: Non Deterministic Finite Automata (NDFA),
Deterministic finite automata machines, conversion of NDFA to DFA, minimization of
automata machines, regular expression, Arden’s theorem. Meaning of union,
intersection, concatenation and closure, 2 way DFA.

Unit-III
Grammars: Types of grammar, context sensitive grammar, and context free grammar,
regular grammar. Derivation trees, ambiguity in grammar, simplification of context free
grammar, conversion of grammar to automata machine and vice versa, Chomsky
hierarchy of grammar, killing null and unit productions. Chomsky normal form and
Greibach normal form.

Unit-IV
Push down Automata: example of PDA, deterministic and non-deterministic PDA,
conversion of PDA into context free grammar and vice versa, CFG equivalent to PDA,
Petrinet model.
MADHAV INSTITUTE OF TECHNOLOGY AND SCIENCE, GWALIOR – 474005
(A Govt. Aided UGC Autonomous Institute Affiliated to R.G.P.V. Bhopal, M.P.)

Unit-V
Turing Machine: Techniques for construction. Universal Turing machine Multitape,
multihead and multidimensional Turing machine, N-P complete problems. Decidability
and Recursively Enumerable Languages, decidability, decidable languages,
undecidable languages, Halting problem of Turing machine & the post correspondence
problem.
----------------------------------------------------------------------------------------------------------------

RECOMMENDED BOOKS
 Introduction to Automata Theory Language & Computation, Hopcroft & Ullman,
Narosa Publication.
 Element of the Theory Computation, Lewis & Christors, Pearson.
 Theory of Computation, Chandrasekhar & Mishra, PHI.
 Theory of Computation, Wood, Harper & Row.
 Introduction to Computing Theory, Daniel I-A Cohen, Wiley.
-----------------------------------------------------------------------------------------------------------------

COURSE OUTCOMES
After completion of this course, the students would be able to:

CO1. explain the basic concepts of switching and finite automata theory & languages.
CO2. relate practical problems to languages, automata, computability and complexity.
CO3. construct abstract models of computing and check their power to recognize the
languages.
CO4. analyse the grammar, its types, simplification and normal form.
CO5. interpret rigorously formal mathematical methods to prove properties of languages,
grammars and automata.
CO6. develop an overview of how automata theory, languages and computation are
applicable in engineering application.

------------------------------------------------------------------------------------------------

You might also like