Notebooks

New Page

Designing CFGs and closure properties of CFL’s

Introduction of PDA

Deterministic Pushdown Automata and NPDA

Conversion between PDA and CFG

Turing machines

Variants of TMs

Recursive and recursively enumerable languages

Decidable and undecidable problems

Introduction of P, NP, NP complete, NP hard problems

Syllabus - Theory of Computation (IT-503 (A))

← Previous
1
2
…
60
61
62
63
64
65
66
67
68
…
929
930
Next →