AD-501 Theory of Computation Notes
5 notes for Theory of Computation, unit by unit.
Notes for AD-501
- Unit 1 · Short notes Introduction of Automata Theory Review of Sets · Mathematical formal proofs including proof by induction and by contradiction · Introduction to languages, grammars and automata: Alphabet · Representation of language and grammar · Types of Automata · Finite Automata as a language acceptor and translator
- Unit 2 · Short notes Types of Finite Automata Non Deterministic Finite Automata (NDFA) · Deterministic finite automata machines · Conversion of NDFA to DFA · Minimization of automata machines · Regular expression · Applications of regular expressions
- Unit 3 · Short notes Grammars Types of grammar · Context sensitive grammar · Context free grammar · Regular grammar · Derivation trees · Ambiguity in grammar
- Unit 4 · Short notes Push down Automata Example of PDA · Deterministic and non‑deterministic PDAs · Context Free Grammar · Parsing · Ambiguity · Normal form of CFGs
- Unit 5 · Short notes Turing Machine Turing Machine as acceptor · Recognizing a Language · Universal TMs · Linear Bounded Automata · Context Sensitive Languages · Recursive and Recursively Enumerable Languages
More for AD-501
Other 5th semester AD subjects
- AD-502 Machine Learning
- AD-503 (A) Internet and Web Technology
- AD-503 (B) Computer Graphics & Multimedia
- AD-503 (C) Computer Org. & Architecture
- AD-504 (A) Management Information System
- AD-504 (B) Game Theory with Engineering Applications
- AD-504 (C) Operations Research
- AD-506 Linux Lab