Name: Notes for Theory Of Computation TC by Verified Writer
Rating: 3.6 (100 reviews)
Author: Verified Content Maker

Automata Theory, finite automata theory, Extended transition function, DFA, NFA with 6-Transition, External NFA

Automata Theory

Regular Expression, Indentities of Regular Expression, Ardern s Theorem, Pumping Temma for Regular Expression, Minimization of DFA

Regular Expression

Grammar, Ambiguity in Grammar, types of grammar, Usless Production, Eliminating Null Production, Removing Unit Production, Greibean Normal Form, CYA algorithm, Chomosky Classification of Grammar, Heirarchy of Grammar, Push Down Automata, Deterministic PDA, non-deterministic PDA, Pumping lemma for CFL

Grammar

Turing Machine, Variness of Turing, Church Turing Hypothesis, Universal Turing Machine

Turing Machine

Decidability Theory, Co-turing Recognizable, post correspondence problem, mapping Reducible

Decidability Theory

Odgens Law

Student at Amity University

Verified Content Maker

B.Tech / BE

Notes for Theory Of Computation - TC by Verified Writer 

Notes for Theory Of Computation - TC by Verified Writer

BPUT ·

TC