CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
  • Theory of Automata - IT2 - V Sem - 2020-2021
    0%
  • Previous
  • Course data
    General
    Announcements
    Syllabus of TOA(18ITC16)
    TOA text book
    LESSON Plan-TOA-V SEM -IT2
    TOA Assignment-01
    TOA Assignment -01 Submission link
    TOA SLIP TEST-01
    TOA SLIP TEST-02 on 16.11.2020
    TOA SLIPTEST-2 Solutions
    TOA MID-1(2020-21) Solutions
    TOA ASSIGNMENT-02
    TOA ASSIGNMENT 02 - SUBMISSION LINK
    TOA-Assignment02-Solutions
    TOA MID-2 (2020-21) Solutions
    TOA-Handwritten Notes
    U1-Automata-P1-10.08.20-14.30
    COURSE OVERVIEW & Introduction to the Automata
    unit-1- Introduction to the Automata
    u1-FiniteAutomata-12.08.20-9:30
    class recording of FiniteAutomata-DFA introduction and Design of DFAs
    U1-Deterministic Finite Automata-14.08.20-11.00
    Class Recording of DFA Design and processing of string
    DFA Pdf
    U1-DFA Examples-17.08.20-14:30
    DFA Examples and using extended transition function for processing a string
    U1-Nondeterministic Finite Automata-19.08.20-13:00
    class recording of NFA Definition & Design
    NFA Definition & Design PPT
    U1-Equivalence of NFA and DFA-21.08.2020-11.00
    class recording-Conversion from NFA to DFA-Subset construction method
    Conversion from NFA to DFA -Example
    U1-Epsilon NFA-Design,Definition-24.08.2020-14.30
    class recording of Epsilon NFA Design
    U1-Extended transition function for E-NFA and its usage for processing strings-26.08.2-9.30
    class recording on Extended Transition function for Epsilon NFA and its usage
    U1-Equivalence of E-NFA to NFA-28.08.2020-11.00
    Class recording of conversion from E-NFA to NFA
    U2-Regular Expressions &Languages-31-08-2020-14.30
    class Recording of Regular Expressions-Introduction
    U2-Conversion from Regular Expression to Epsilon Finite Automata-02.09.2020-9:30
    Class recording -conversion from RE to E-NFA
    Regular Expressions-edx
    U2-Conversion from Deterministic Finite Automata to Regular Expression using K-path -04.09.2020-11.00
    Class Recording of conversion from DFA to RE
    U2-Conversion from FA to RE using state elimination method,Arden's theorem-07.09.2020-14:30
    class recording
    Conversion from DFA to RE
    U2-Conversion from DFA to RE using state elimination method-08.09.2020-11.00
    class recording and example problem
    U2-Writing Regular Expressions-09.09.2020-9.30
    Class recording on Regular Expression Examples
    Regular Expressions-Examples
    U2-Pumping lemma for RL-18.09.2020-11.00
    Pumping lemma for Regular Language
    PPT for Pumping lemma for Regulate Languages
    U2-Closure and Decision properties of Regular Language-21.09.20-14.30
    class Recording
    Closure Decision Properties of RegularLanguage
    U2-Minimization of DFAs-22-09-2020-1.00
    Class Recording
    Minimisation of DFAs
    U2-Equivalence of regular languages and revision of UNIT-2-23.09.2020
    Class recording
    U3-Context Free Grammars & Context Free languages-25-09-2020-11.00
    Class Recording for 50 min
    class recording for 10 min
    U3-Leftmost and Rightmost derivations in CFGs-28.09.30-14.30
    Class Recording
    CFL-P1
    U3-Parse tree and Ambiguity of Context Free Grammars-30.09.2020-9.30
    Class Recording
    CFL-P2
    U3-Inherently ambiguous Grammars,,Elimination of Useless Symbols-01.10.20-13.00
    class recording part-1
    class recording part-2
    U3-Elimination of Epsilon productions and Unit production,Chomsky Normal form -07.10.2020-11.00
    class recording
    CFL-P3
    U3-Simplification of a grammar and conversion into CNF -09.10.2020-11.00
    Class Recording
    Context Free Grammars-Examples
    U3-Simplifying grammar and CNF conversion,Pumping lemma for CFL Definition-19.10.20-14.30
    Class Recording
    Remaining Classes
    T27-U3-PumpingLemma for CFLs-Proof-21.10.2020-11.00
    T28-U3-Applications of Pumping lemma for CFLs-22.10.20-13.00
    T29-U3-Closure properties of CFLs-23.10.20-11.00
    T30-U3-CYK Algorithm-27.10.20-11.00
    T31-U4-PDA Definition,Design- one Example-28.10.20-09.30
    T32-U4-PDA Design-Instantaneous Description-02.11.20-14.30
    T33-U4-PDA Design & its Transition Diagram-04-11-2020-09.30
    T34-U4-Acceptance of PDA by empty Stack,Final state and conversion from CFG to PDA-06.11.20-11.00
    U4-T35-Conversion from PDA to CFG-Example problem-09-11-20-14.30
    U5-T36-Turing machines :Introduction, definition.instantaneous Description,Design-11.11.20-11.00
    T37-U5-design of Turing machine for proper subtraction-12.11.20-13.00
    T38-U5-Turing machine for Multiplication function-13.11.2020-11.00
    T39-U5-Variations of Turing Machines-Undecidable Problem
    T40-U5-Coding Turing Machines as binary integers and PCP ,MPCP -18.11.2020-9.30
    T41-U5-Recursive and Recursively Enumerable Language properties , Rice Theorem-Revision of UNIT-5-23.11.2020-14.30
    T42-Revision of TOA mid-2 syllabus and all the OS Lab programs 25-11-2020
    PPT for UNIT-3 PART-2
    Closure & Decision Properties of CFLs
    Pumping Lemma of CFLs-Example
    Pumping Lemma for CFLs
    PPT for UNIT-4 PDA
    PDA P1
    Eqivalence of CFGs & PDAs
    PPT for UNIT-5
    Turing Machines
    Undecidability(P1)
    PCP & MPCP
  • Next
  CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
    • Log in
      Forgot Password?
    Theory of Automata - IT2 - V Sem - 2020-2021
    Home
    Skip to main content

    Course info

    1. Home
    2. Courses
    3. Information Technology
    4. UG
    5. Academic Year 2020-2021
    6. V Semester
    7. Theory of Automata - IT2 - V Sem - 2020-2021
    8. Summary

    Theory of Automata - IT2 - V Sem - 2020-2021

    • Teacher: Smt. A.Sirisha Assistant Professor
    Skill Level: Beginner

    Follow Us

    Chaitanya Bharathi Institute of Technology(Autonomous), Hyderabad
    You are not logged in. (Log in)
    Get the mobile app