Curriculum
- 4 Sections
- 49 Lessons
- 10 Weeks
Expand all sectionsCollapse all sections
- module1 Foundation and Finite Automata16
- 1.1introducing automata simple models
- 1.2Three basic concepts: Alphabet, Strings, and Languages
- 1.3Formal definition of a finite automaton
- 1.4Deterministic Finite Automata (DFA)
- 1.5Regular languages
- 1.6nondeterministic finite automaton
- 1.7NFA with epsilon transitions
- 1.8Equivalence of NFAs and DFAs
- 1.9DFA State Minimization
- 1.10Operations of regular languages
- 1.11NFA example 1
- 1.12NFA example 2
- 1.13NFA to DFA example 1
- 1.14NFA to DFA example 2
- 1.15DFA state minimization example
- 1.16conversion on Epsilon NFA to NFA
- Module 2 Regular Expressions, Properties of Regular language,Context-Free Grammars and Applications15
- 2.1The formal definition of a regular expression
- 2.2Regular expression examples
- 2.3designing regular expression
- 2.4NFA to RE
- 2.5DFA to RE
- 2.6conversion of RE to FA
- 2.7conversion of RE to FA
- 2.8Pumping Lemma
- 2.9Pumping Lemma example1
- 2.10Regular grammar
- 2.11Derivations from a Grammar
- 2.12CFG and CFL
- 2.13Derivation Trees(Left and right derivation trees)
- 2.14Ambiguous grammar
- 2.15Simplification of CFG
- Module 3 PDA and CFL8
- Module 4 Turning Machine10
- 4.1Turning machine definition
- 4.2Turning machine example
- 4.3The church turning thesis
- 4.4turning machine for even palindromes
- 4.5multitape turning machine
- 4.6Decidability and undecidability
- 4.7universal turning machine
- 4.8halting problem
- 4.9undecidability of the halting problem
- 4.10undecidability of the post correspondence
