Theory of Computing (Tamil)
11 videos • 183 views • by Learn and Teach with A R U N Theory of Computation (Tamil) Theory of Computing in Tamil #TOCinTamil #THEORYOFCOMPUTATION #DFA #NFA #MOOREMACHINE #MEALYMACHINE #MOORE #MEALY #FSM #FiniteStateMachine #FiniteAutomata #Moore machine Example in Tamil | 22PCSCE16-3: THEORY OF COMPUTATION | Automata Theory | Introduction to formal proof – Additional forms of proof– Inductive proofs –Finite. Automata (FA) – Deterministic Finite Automata (DFA) –Non-deterministic Finite Automata (NFA)–Finite Automata with Epsilon transitions. Regular Expression– FA and Regular Expressions – Proving languages not to be regular–Closure properties of regular languages –Equivalence and minimization of Automata. Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages–Definition of the Push down automata –Languages of a Push down Automata – Equivalence of Push down automata and CFG –Deterministic Push down Automata. Normal forms for CFG–Pumping Lemma for CFL–Closure Properties of CFL–Turing Machines–Programming Techniques for TM. A language that is not Recursively Enumerable (RE). An undecidable problem RE–Undecidable problem about Turing Machine–Post’s Correspondence Problem–The classes P and NP.