Scribd
Upload
30 views2 pages

Theory of Computation Toc Lecture Plan

Uploaded by

betagemini35
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
30 views2 pages

Theory of Computation Toc Lecture Plan

Uploaded by

betagemini35
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Lecture Plan

Subject Title Theory Of Computation Session : Jan-Jun 2023

Sub. Code CS 501 & AL601 Semester V, VI

Department Computer Science & Engineering Branch CSE, AIML

Lect. Date of Remarks


no Topic to be covered Completion

UNIT-1

Introduction of Automata Theory: Examples of automata machines


1.
Finite Automata as a language acceptor and translator
2.
Moore machines
3.
Mealy machines
4.
Composite machine
5.
Conversion from Mealy to Moore and vice versa
6.
Conversion from Mealy to Moore and vice versa
7.

8. Conversion from Mealy to Moore and vice versa


UNIT-2

Types of Finite Automata: Non Deterministic Finite Automata


9. (NDFA),

Deterministic finite automata machines


10.

11. Deterministic finite automata machines


Conversion of NDFA to DFA
12.
Minimization of automata machines
13.
Regular expression
14.
Arden’s theorem
15.
Meaning of union, intersection, concatenation and closure, 2 way
16.
DFA.
UNIT-3

17. Grammars: Types of grammar, context sensitive grammar

Context free grammar, Regular grammar.


18.
Derivation trees, ambiguity in grammar, simplification of context
19.
free grammar
Conversion of grammar to automata machine and vice versa
20.
Chomsky hierarchy of grammar
21.
Killing null and unit productions.
22.
Chomsky normal form
23.
Greibach normal form
24.
UNIT-4

25. Push down Automata: example of PDA

Deterministic and non-deterministic PDA


26.

27. conversion of PDA into context free grammar and vice versa
Conversion of PDA into context free grammar and vice versa
28.
Conversion of PDA into context free grammar and vice versa
29.
Conversion of PDA into context free grammar and vice versa
30.
CFG equivalent to PDA
31.

32. Petrinet model.


UNIT-5

33. Turing Machine: Techniques for construction

Universal Turing machine Multitape


34.

35. Multihead and multidimensional Turing machine

36. N-P complete problems


Decidability and Recursively Enumerable Languages, decidability
37.
Decidable languages & Undecidable languages
38.
Halting problem of Turing machine.
39.
The post correspondence problem
40.

You might also like