BSCS3021 · Knowledge Base
Theory of Computation Notes
13
Concepts
0
Facts
0
Procedures
concept
1m
385 - Finite Automata — DFA, NFA, ε-NFA
concept
1m
386 - NFA to DFA Conversion — Subset Construction
concept
1m
387 - Regular Expressions & Pumping Lemma
concept
1m
388 - Regular Expression to DFA — Direct Conversion and Properties
concept
1m
389 - DFA Minimization and Pumping Lemma
concept
1m
390 - Context-Free Grammars
concept
1m
391 - CFG to PDA Conversion and PDA to CFG
concept
1m
392 - Pushdown Automata
concept
1m
393 - Turing Machines — Definition, Variants, Church-Turing Thesis
concept
1m
394 - Turing Machine Variants & Church-Turing Thesis
concept
1m
395 - Decidability — Undecidable Problems, Halting Problem
concept
1m
396 - Reductions — Proving Undecidability
concept
1m