Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Theory of Computation (310241)
Unit I Formal Language Theory and Finite Automata
Session 1 :Introduction to Formal language,
Session 2 : introduction to language translation logic
Session 3 :; Essentials of translation
Session 4 : Alphabets and languages, Finite representation of language
Session 5 : Finite Automata (FA): An Informal Picture of FA
Session 6 :Finite State Machine (FSM)
Session 7 : Language accepted by FA
Session 8 : Definition of Regular Language
Session 9 :Deterministic and Nondeterministic FA(DFA and NFA),
Session 10 : epsilon- NFA, FA with output: Moore and Mealy machines -Definition, models, inter-conversion
Unit II Regular Expressions (RE)
Session 11 : Introduction, Operators of RE
Session 12 : Building RE, Precedence of operators,
Session 13 :Algebraic laws for RE
Session 14 :Conversions: NFA to DFA, RE to DFA Conversions: RE to DFA, DFA to RE Conversions: State/loop elimination
Session 15 : Arden’s theorem Properties of Regular Languages: Pumping Lemma for Regular languages, Closure and Decision properties
Unit III Context Free Grammars (CFG) and Languages
Session 16 : Introduction, Regular Grammar
Session 17 : Context Free Grammar- Definition, Derivation, Language of grammar, sentential form, parse tree, inference, derivation, parse trees, ambiguity in grammar and Language- ambiguous Grammar
Session 18 : Simplification of CFG: Eliminating unit productions, useless production, useless symbols, and Є-productions
Session 19 : Normal Forms- Chomsky normal form, Greibach normal form, Closure properties of CFL, Decision properties of CFL, Chomsky Hierarchy
Session 20 : Application of CFG: Parser, Markup languages, XML and Document Type Definitions.
Unit IV Turing Machines (TM)
Session 21 : Turing Machine Model, Representation of Turing Machines
Session 22 : Language Acceptability by Turing Machines
Session 23 :Design of TM, Description of TM
Session 24 : Techniques for TM Construction, Variants of Turing Machines
Session 25 : The Model of Linear Bounded Automata , TM & Type 0 grammars, TM’s Halting Problem.
Unit V Pushdown Automata(PDA)
Session 26 : Basic Definitions
Session 22 : Language Acceptability by Turing Machines
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock