Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Theory of Computer Science (CSC504)
Session 1 : Basic Concepts and Finite Automata
Session 1 : Alphabets, Strings, Languages, Closure properties
Session 2 :Finite Automata (FA) and Finite State machine (FSM).
Session 3 : Deterministic Finite Automata (DFA) and Nondeterministic Finite Automata (NFA): Definitions, transition diagrams and Language recognizers
Session 4 :NFA to DFA Conversion
Session 5 : Equivalence between NFA with and without ε- transitions
Session 6 : Minimization of DFA
Session 7 : FSM with output: Moore and Mealy machines, Equivalence
Session 8 : Applications and limitations of FA
Unit 2 Regular Expressions and Languages
Session 9 : Regular Expression (RE)
Session 10 : Equivalence of RE and FA, Arden‘s Theorem
Session 11 : RE Applications
Session 13 :Regular Language (RL)
Session 14 : Closure properties of RLs
Session 15 :Decision properties of RLs Pumping lemma for RLs
Unit 3 Grammars
Session 16 : Grammars and Chomsky hierarchy
Session 17 : Regular Grammar (RG)
Session 18 : Equivalence of Left and Right linear grammar
Session 19 : Equivalence of RG and FA
Session 20 : Context Free Grammars (CFG)
Unit 4 Pushdown Automata(PDA)
Session 21 :Definition, Transitions ,Language of PDA
Session 22 : Language acceptance by final state and empty stack
Session 23 : PDA as generator, decider and acceptor of CFG.
Session 24 : Deterministic PDA , Non-Deterministic PDA
Session 25 : Application of PDA.
Unit 5 Turing Machine (TM)
Session 26 : Definition, Transitions
Session 27 : Design of TM as generator, decider and acceptor.
Session 28 : Variants of TM: Multitrack, Multitape
Session 29 : Universal TM. Equivalence of Single and Multi Tape TMs.
Session 30 : Applications, Power and Limitations of TMs. Context Sensitivity and Linear Bound Automata.
Unit 6 : Undecidability
Session 31 : Decidability and Undecidability
Session 32 : Recursive and Recursively Enumerable Languages.
Session 33 : Halting Problem, Rice‘s Theorem,
Session 34 : Post Correspondence Problem
Session 3 : Deterministic Finite Automata (DFA) and Nondeterministic Finite Automata (NFA): Definitions, transition diagrams and Language recognizers
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock