Download Udemy – Theory of Computation 2023-11

Description

Theory of Computation course. Finite State Machines: Alphabets, Strings, Formal and Natural Language, Operations, Definition and Design of DFA (Deterministic Finite Automata), NFA (Non-deterministic Finite Automata), Equivalence of NFA and DFA: Conversion of NFA to DFA, Convert NFA with move epsilon to NFA, minimize DFA, define and construct Moore and Milley machines, convert between Moore and Milley machines. Minimizing bounded automata. (Construction of minimal automatic) Regular expression and regular grammar: definition and identity of regular expressions, construction of regular expression of the given language, construction of language from RE, conversion of FA to RE using Arden’s theorem, conversion of RE to FA, pumping lemma for RL , closure properties of RLs, regular grammar, equivalence of RG (RLG and LLG) and FA grammars and context-free languages: introduction, formal definition of grammar, symbols, derivation process: left derivation, rightmost derivation, derivation trees, construction of grammars and context-free languages, pumping lemma for CFL, CFG simplification, regular forms (CFG) GNF), Chomsky Hierarchy Pushdown Automata: introduction and definition of PDA, construction of PDA, acceptance of CFL, equivalence of CFL and PDA: between transformation, introduction of DCFL and DPDA, enumeration of CFL properties, context-sensitive language, linear finite automata Turing machines: formal definition of Turing machine, TM design, computable functions, Church hypothesis, counting machine, types of Turing machines: multi-band Turing machines, universal decidability Turing machine and undecidability: decidability of problems, TM problem solving, undecidability: recursive enumerable language, properties of recursive and non-recursive enumerable languages, post matching problem, introduction to the theory of recursive functions

What you will learn in Theory of Computation course

Construction of finite state machines to solve problems in computing
Regular expressions for formal languages
Build and analyze Push Down, Turing Machine, Linear Bounded Automata for formal languages
Understanding Chomsky’s Hierarchy
Decidable and undecidable problems