Scribd
Upload
13 views2 pages

Syllabus

The document outlines the syllabus for a course on Theory of Computation, covering topics such as automata theory, regular expressions, context-free grammar, Turing machines, and undecidability. It includes details on finite automata, regular languages, pushdown automata, normal forms, and unsolvable problems. The course emphasizes the equivalence of different computational models and the properties of various language classes.

Uploaded by

shyni
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
13 views2 pages

Syllabus

The document outlines the syllabus for a course on Theory of Computation, covering topics such as automata theory, regular expressions, context-free grammar, Turing machines, and undecidability. It includes details on finite automata, regular languages, pushdown automata, normal forms, and unsolvable problems. The course emphasizes the equivalence of different computational models and the properties of various language classes.

Uploaded by

shyni
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/ 2

UNIT I AUTOMATA AND REGULAR

EXPRESSIONS CS3452 Theory of Computation


Syllabus

Need for automata theory – Introduction to formal


proof – Finite Automata (FA) – Deterministic Finite
Automata (DFA) – Non-deterministic Finite Automata
(NFA) – Equivalence between NFA and DFA –
Finite Automata with Epsilon transitions – Equivalence
of NFA and DFA- Equivalence of NFAs with and
without ε-moves- Conversion of NFA into DFA –
Minimization of DFAs.

UNIT II REGULAR EXPRESSIONS AND


LANGUAGES CS3452 Theory of Computation
Notes

Regular expression – Regular Languages- Equivalence


of Finite Automata and regular expressions –
Proving languages to be not regular (Pumping Lemma)
– Closure properties of regular languages.

UNIT III CONTEXT FREE GRAMMAR AND PUSH


DOWN AUTOMATA CS3452 Theory of Computation
Important Questions

Types of Grammar – Chomsky‘s hierarchy of languages


-Context-Free Grammar (CFG) and Languages
– Derivations and Parse trees – Ambiguity in grammars
and languages – Push Down Automata (PDA):
Definition – Moves – Instantaneous descriptions -
Languages of pushdown automata – Equivalence of
pushdown automata and CFG-CFG to PDA-PDA to CFG
– Deterministic Pushdown Automata.

UNIT IV NORMAL FORMS AND TURING


MACHINES CS3452 Theory of Computation
Question Bank
Normal forms for CFG – Simplification of CFG-
Chomsky Normal Form (CNF) and Greibach Normal
Form (GNF) – Pumping lemma for CFL – Closure
properties of Context Free Languages –Turing
Machine : Basic model – definition and representation
– Instantaneous Description – Language
acceptance by TM – TM as Computer of Integer
functions – Programming techniques for Turing
machines (subroutines).

UNIT V UNDECIDABILITY CS3452 Theory of


Computation Question Paper

Unsolvable Problems and Computable Functions –PCP-


MPCP- Recursive and recursively enumerable
languages – Properties – Universal Turing machine -
Tractable and Intractable problems – P and NP
completeness – Kruskal’s algorithm – Travelling
Salesman Problem- 3-CNF SAT problems.

You might also like