CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
  • 18ITC16-IT3-Theory of Automata-5thSem-2021-22
    0%
  • Previous
  • Course data
    General
    Announcements
    TOA Assignment-01 on 27AUG2021 Submission
    TOA-18ITC16-QP -Main exam jan2021
    ToA-16ITC20-QP-Backlog exam jan2021
    ToA Slip Test-01 on 18SEP2021
    ToA Sliptest-02 on 22-11-2021
    Course Details
    Syllabus
    Text Book
    Lecture Recordings
    S2-U1-Central Concepts of Finite Automata Theory & Introduction to Finite Automata-1.10pm-2.10pm-06Aug2021
    S3-U1-DFA Design and Formal definition, Extended transition function-9.10AM to 10.10AM-09AUG2021
    S4-U1-DFA Examples-Language of FA-Regular Language-10.20am-11.20am-10AUG2021
    S5-U1-Introduction to NFA-Definition, Design, Difference between DFA &NFA-1.10PM 2.10PM-13AUG2021
    S6-U1-Equivalence of NFAs and DFAs-9.10am-10.1-am-16Aug2021
    S7-U1-Introduction to Epsilon NFA-10.20am to 11.20am-17AUG2021
    S8-U1-Epsilon NFA-Eclosure-Extended function for Epsilon NFA-9.10AM to 10.10AM-23AUG2021
    S9-U1-Conversion from Epsilon NFA to DFA-10.20AM-11.20AM-24AUG2021
    S10-TOA Assignment 01 Test on unit-1
    S11-U2-Regular Expression Introduction and Conversion from RE to E-NFA 9.10AM to 10.10AM -30AUG2021
    S12-U2-Regular Expression to Epsilon NFA ,FA to RE using K-Path Concept-9.10AM to10.10AM-06SEP2021
    S13-U2-DFA to RE conversion by state elimination method-10.20AM to 11.20AM-07SEP2021
    s14-U2-Conversion from FA to RE using Arden's theorem and State Elimination Method-2.20pm to 3.20pm-09SEP2021
    S15-U2-Algebric Laws of Regular expressions-writing regular expressions for given Languages-10.20am to 11.20am-16sep2021
    s16-U2-Pumping lemma for Regular Languages-11.30am to 12.30pm-17sep2021
    s17-U2-Example of usage of Pumping lemma-11.30am -12.30pm-18SEP2021
    S18-U2-Minimization of DFAs-Table filling algorithm-10.20am-11.20am-23SEP2021
    S19&20-U2&U3-Closure properties of Regular Languages & Context Free Languages-10.20am -12.20pm-24SEP2021
    S21-U3-Left most Derivations and Right most Derivations, Parse trees, Ambiguity in CFGs-11:30am-12.30pm-25SEP2021
    S22-U3-Normal forms-Elimination of useless Symbols-1.10pm to 2.10pm-01OCT2021
    S23-U3-Conversion of the grammar into CNF Form-9.10am to 10.10am-04OCT2021
    S24-U3-Pumping lemma for CFLs Statement &applications-10.20am-11.20am-o5OCT2021
    S25-U3-Pumpoing lemma for CFLs Proof-1.10pm to2.10pm-08OCT2021
    S26-U3-CLOSURE PROERTIES OF CFLs-10.10am to11.10am-11OCT2021
    S27-U3-Decision Properties of CFLs-CYK Algorithm-10.20am to11.20am-12OCT2021
    S28-U4-PDA Definition and Design, Instantaneous Description-1.10pm to 2.10pm-22OCT2021
    Lecture Notes
    Finite Automata-DFA PPT
    Finite Automata-NFA PPT
    NFA Examples
    Equivalence of NFAs and DFAs (NFA to DFA Conversion)-Example
    NFA with Epsilon Transitions-Conversion from E-NFA to DFA-Examples
    Regular Expressions PPT
    Writing Regular Expressions for Languages
    Conversion from RE to E-NFA Solved Problems
    Conversion from FA to RE -Solved problems
    Pumping lemma for Regular Language
    Closure Decision Properties of RegularLanguage
    Minimization of DFAs PPT
    Minimization of DFAS s solved Problems
    ContextFreeGrammars
    CFLProperties
  • Next
  CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
    • Log in
      Forgot Password?
    18ITC16-IT3-Theory of Automata-5thSem-2021-22
    Home
    Calendar
    Skip to main content

    Course info

    1. Home
    2. Courses
    3. Information Technology
    4. UG
    5. Academic Year 2021-2022
    6. 5th Semester
    7. 18ITC16-IT3-Theory of Automata-5thSem-2021-22
    8. Summary

    18ITC16-IT3-Theory of Automata-5thSem-2021-22

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

    Follow Us

    Chaitanya Bharathi Institute of Technology(Autonomous), Hyderabad
    You are currently using guest access (Log in)
    Get the mobile app