Content will be published soon
Context-free Grammar (CFG)
read more
Theory of Computation
Syllabus with topics linked
Deterministic and Non-deterministic Pushdown Automata (PDA)
Content will be published soon
Relationship Between CFG and PDA
Content will be published soon
Parse Trees
Content will be published soon
Leftmost Derivation
Content will be published soon
Ambiguities in Grammars
Content will be published soon
Pumping Lemma for Context-free Languages (CFL)
Content will be published soon
Properties of Context-free Languages (CFL)
Content will be published soon
Chomsky Normal Form
Content will be published soon
Turing Machine as a Model of Computation
Content will be published soon
Recursive and Recursively Enumerable Languages
Content will be published soon
Church Turing Thesis
Content will be published soon
Universal Turing Machine
Content will be published soon
Decidability
Content will be published soon
Halting Problem
Content will be published soon