AL-601 Theory of Computation Notes
5 notes for Theory of Computation, unit by unit.
Notes for AL-601
- Unit 1 · Short notes Introduction to Automata Theory Examples of automata machines · Finite Automata as language acceptor and translator · Moore machines · Mealy machines · Composite machine · Conversion from Mealy to Moore and vice versa
- Unit 2 · Short notes Types of Finite Automata Non‑deterministic Finite Automata (NFA) · Deterministic Finite Automata (DFA) · Conversion of NFA to DFA · Minimization of automata · Regular expressions · Arden’s theorem
- Unit 3 · Short notes Grammars Types of grammar · Context‑sensitive grammar · Context‑free grammar (CFG) · Regular grammar · Derivation trees · Ambiguity in grammar
- Unit 4 · Short notes Pushdown Automata Examples of Pushdown Automata (PDA) · Deterministic PDA · Non‑deterministic PDA · Conversion of PDA to CFG and vice versa · CFG equivalent to PDA · Petri‑net model for PDA
- Unit 5 · Short notes Turing Machines and Decidability Construction techniques for Turing machines · Universal Turing machine · Multi‑tape, multi‑head and multidimensional Turing machines · NP‑complete problems · Decidable and recursively enumerable languages · Decidability
More for AL-601
Other 6th semester AIML subjects
- AL-602 Computer Networks
- AL-603 (A) Image and Video Processing
- AL-603 (B) Data and Visual Analytics
- AL-603 (C) Pattern Recognition
- AL-604 (A) Cloud Computing
- AL-604 (B) Information Security & Management
- AL-604 (C) Intelligent Systems for Robotics