Scribd
Upload
26 views

Theory of Computation Syllabus

Uploaded by

Niva Tripathy
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
26 views

Theory of Computation Syllabus

Uploaded by

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

ETCST206: THEORY OF COMPUTATION

TEACHING SCHEME: 3-0-0 (L-T-P) CREDIT: 3

COURSE OBJECTIVES:
To introduce students to the mathematical foundations of computation including automata
theory; the theory of formal languages and grammars; the notions of algorithm, decidability,
complexity, and computability.

COURSE CONTENT
MODULE I : (12 classes)
Introduction: Automata, Computability, and Complexity, Strings and languages: symbol,
alphabet, string/ word. Language - Definition, language states, difference between natural and
formal language. Finite Automata: Formal definition of a finite automaton, Examples of finite
automata, Formal definition of computation, Designing finite automata, Non-determinism:
Formal definition of a nondeterministic finite automaton, Equivalence of NFAs and DFAs,
Minimization of Finite Automata, Mealy and Moore Machine, Closure under the regular
operations.

MODULE-II: (6 Classes)
Regular Expressions and Pumping Lemma: Regular Expressions: Formal definition of a regular
expression, Equivalence with finite automata. Non-regular Languages: The pumping lemma for
regular languages.

MODULE-III: (10 Classes)


Context-Free Languages: Context-free Grammars: Formal definition of a context-free grammar,
Examples of context-free grammars, Designing context-free grammars, Ambiguity, Chomsky
normal form. Pushdown Automata: Formal definition of a pushdown automaton, Examples of
pushdown automata, Equivalence with context-free grammars. Non-context-free Languages:
The pumping lemma for context-free languages.

MODULE-IV: (12 Classes)


The Church-Turing Thesis: Turing Machines: Formal definition of a Turing machine, Examples
of Turing machines. Variants of Turing Machines: Multi-tape Turing machines, Nondeterministic
Turing machines, Terminology for describing Turing machines. Decidability: Decidable
Languages: Decidable problems concerning regular languages, Decidable problems concerning
context-free languages, The Halting Problem: The halting problem is undecidable, A Turing-
unrecognizable language. Post Correspondence Problems.

COURSE OUTCOMES:
At the end of the course, the student will be able to:
CO CODE CO STATEMENT COGNITIVE
LEVEL
ETCST206.1 Select a formal notation for strings, languages and machines. Evaluate
Design Finite State Machine and Write the hierarchy of formal
languages, grammars and machines.
ETCST206.2 Examine whether the given language is regular or not. Analyze
ETCST206.3 Design context free grammars to generate strings of context Create
free language. Determine equivalence of languages accepted by
Push Down Automata and languages generated by context free
grammars
ETCST206.4 Distinguish between computability and non-computability and Analyze
Decidability and undecidability. Explain the Decidability or
Undecidability of various problems.

TEXT BOOKS:

1. Michael Sipser, “Introduction to the Theory of Computation”, Cengage Learning


Publications, 3rd Edition, 2013.
2. John E Hopcroft, Rajeev Motwani, J D Ullman, “Introduction to Automata theory,
Languages, and Computations”, Pearson Education Publisher, 3rd Edition, 2009

REFERENCE BOOKS:

1. E. V. Krishnamurthy, “Theory of computer science”, Affiliated East Press Publications,


2004.
2. Dexter C. Kozen, Automata and Computability, Springer Verlag Publications.
3. Harry Lewis, Christos H. Papadimitriou, “Elements of the Theory of Computation,” Prentice-
Hall Publications, 2nd Edition, 1997.
4. John Martin, “Introduction to Languages and Theory of Computations”, McGraw-Hill
Publications, 4th edition, 2010.

You might also like