Scribd
Upload
71 views2 pages

On Theory of Computation Session Schedule B R E A K L U N C H B R E A K

The document contains the schedule for a 7-day faculty development training program on theory of computation held from June 6-12, 2016. The schedule outlines the daily sessions, topics to be covered, and timings. Some of the key topics included are finite automata and regular languages, grammars, pushdown automata, Turing machines, recursively enumerable languages, and complexity classes like P and NP. The schedule also includes sessions for problem discussions and a field visit on the last day.

Uploaded by

Vasantha Kumari
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
71 views2 pages

On Theory of Computation Session Schedule B R E A K L U N C H B R E A K

The document contains the schedule for a 7-day faculty development training program on theory of computation held from June 6-12, 2016. The schedule outlines the daily sessions, topics to be covered, and timings. Some of the key topics included are finite automata and regular languages, grammars, pushdown automata, Turing machines, recursively enumerable languages, and complexity classes like P and NP. The schedule also includes sessions for problem discussions and a field visit on the last day.

Uploaded by

Vasantha Kumari
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

K.L.N.

COLLEGE OF INFORMATION TECHNOLOGY


DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Anna University Approved SEVEN DAYS FACULTY DEVELOPMEN TRAINING PROGRAMME
on Theory of Computation
Session Schedule
B L Session III B Session IV
Session I Session II
R U 1.30 p.m. – 3.00 R
Date 3.15 p.m. to 4.45 p.m
9.00 a.m. to 10.45 a.m. to 12. p.m.
10.30a.m. p.m.
E N E
06.06.201 Introduction, NDFA, Finite Regular Problems Discussion
6 Basic A Automaton C Expression, A
Mathematical with €, moves, Regular Language,
Notation and K Regular H Regular Expression K
techniques. Languages
Finite State
systems, Basic
Definitions,
Finite
Automaton –
DFA

07.06.201 Minimization of Grammar Derivations Elimination of Useless


6 DFA, Pumping Introduction, and Languages , symbols, Unit
Lemma for Types of Ambiguity, productions , Null
Regular sets, Grammar, Derivations productions
Problems based Context Free and Languages ,
on Pumping Grammars and Ambiguity
Lemma. Languages
08.06.201 Greiback Normal Problems Pushdown Deterministic
6 form, Chomsky Discussion Automata, pushdown
normal form , Definitions, automata
Problems Moves,
related to CNF Instantaneous
and GNF. descriptions

09.06.201 Equivalence of Problems Definitions of Techniques for


6 Pushdown Discussion Turing machines , Turing machine
automata and Models, construction, Multi
CFL , pumping Computable head and Multi tape
lemma for CFL languages and Turing Machines
functions
10.06.201 The Halting Chomskian Problems Unsolvable Problems
6 problem, Partial hierarchy of Discussion and Computable
Solvability, languages Functions, Primitive
Problems about recursive functions
Turing machine
11.06.201 Recursive and Universal Tractable and Problems Discussion
6 Turing machine. possibly
recursively MEASURING intractable
enumerable AND problems, P and
languages CLASSIFYINGCO NP completeness,
MPLEXITY: Polynomial time
Tractable and reductions.
Intractable
problems
12.06.201 FIELD VISIT
6

You might also like