Udemy – Theory of Computation 2023-11 – Downloadly

Description

Course “Theory of Computation”. Finite automata: 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: converting NFA to DFA, converting NFA to NFA using shift epsilon, minimizing DFA, defining and constructing Moore and Milley machines, converting between Moore and Milley machines. Minimizing bounded automata. (Construction of a minimal automaticity) Regular expression and regular grammar: definition and identity of regular expressions, construction of a regular expression of the given language, construction of a language from RE, conversion from FA to RE using Arden’s theorem, conversion from 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 (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 machines, 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 the Theory of Computation course

Construction of finite automata to solve computer problems
Regular expressions for formal languages
Create and analyze push-down, Turing machine and linearly constrained automata for formal languages
Understanding Chomsky’s Hierarchy
Decidable and undecidable problems