CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
  • 18ITC16-IT1-Theory of Automata-5thSem-2021-22
    0%
  • Previous
  • Course data
    General
    Announcements
    TOA-Assignment-1
    Slip Test-1
    TOA Assignment-2
    TOA Slip Test-2
    Online Classes
    U1-Introduction to automata_04082021_1310_1410
    U1-Central_concepts_of_Finite automata_05082021_1010 -1110
    U1-DFA-String Process-Exteneded transition function-06082021_1310-1410
    U1-Extending the Transition Function to Strings , The Language of a DFA-10082021-0910-1010
    U1-Nondeterministic Finite Automata: Definition, The Extended Transition Function-12082021-1020-1120
    U1- NFA2DFA Conversion and Problems-13082021-1310-1410
    U1- Finite Automata with Epsilon-Transitions: Use of €-transitions, The formal notation for an €- NFA , €-closure-17082021-0910-1010
    U1-Extended Transitions and Languages for €-NFA’s, Eliminating €-transitions-19082021-1020-1120
    U1- Epsilon NFA to DFA, Previous question Papers discussion-24082021-0910-1010
    U2-Regular Expression and languages: Regular Expressions: The Operators of RE, Building RE-26082021-1020-1120
    U2-Finite Automata and Regular Expression: Converting Regular Expressions to Automata-27082021-1310-1410
    U2-DFA to Regular Expressions-02092021-1020-1120
    U2-DFA to Regular Expression using State Elimination Method-03092021-1310-1410
    U2-Algebraic laws of Regular Expressions-07092021-0910-1010
    U2-Pumping lemma-09092021-1020-1120
    U2-Closure Properties of Regular Languages-16092021-0910-1010
    U2-Decision Properties-17092021-1020-1120
    U2-Minimization of DFA-18092021-1130-1230
    U2-Problems on Minimize using table filling method_23092021_0910_1010
    U3-CFG_Leftmost_Rightmost_Derivations_23092021_1020_1120
    U3-Parse Trees: Constructing Parse Trees-25092021-1130 -1230
    U3-Ambiguous Grammars, Leftmost Derivations as way to Express Ambiguity, Inherent Ambiguity.-01102021-1310-1410
    U3-Eliminating useless symbol, Unit Productions-04102021-1130-1230
    U3-Chomsky Normal Form-05102021-0910-1010
    U3--Pumping Lemma for CFL's-08102021-1310-1410
    U3- Closure Properties-12102021-0910-1010
    U3-CYK Algorithm-14102021-1020-1120
    U3- Removing ambiguity and review of all topics-21102021-1020-1120
    U4- Pushdown Automata-Definition, Graphical representation-22102021-1310-1410
    Material
    U1-Introduction to automata_04082021_1310
    U1-Central_concepts_of_Automata_05082020_1010
    U1-Week1-Notes-10082021-0910-1010
    U1-NFA-Problems-12082021-1020-1120
    U1- FA with epsilon moves- Epsilon Closure-17082021-0910-1010
    U1-Epsilon-NFA to DFA Class Notes-24082021-0910-1010
    U2-Regular Expression and languages: Regular Expressions: The Operators of RE, Building RE-26082021-1020-1120
    U2-Finite Automata and Regular Expression: Converting Regular Expressions to Automata-27082021-1310-1410
    U2_DFA to Regular expressions_02092021_1020-1120
    U2-DFA to Regular Expression using State Elimination Method-03092021-1310-1410
    U2_Algebraic laws_Regular_Expressions_07092021_0910-1010
    U2-Pumping_lemma_09092021_1020-1120
    TOA Unit-1& 2 Notes
    U2-ClosureProperties of Regular Languages_16092021_0910-1010
    U2-Decision Properties Regular Languages_17092021_1020_1120
    U2-Minimization of Deterministic Finite Automata_18092021_1130_1230
    U2-Problems on Minimize using table filling method_23092021_0910_1010
    U3-CFG_Leftmost_Rightmost_Derivations_23092021_1020_1120
    U3-Parse tree_25092021_1130_1230
    U2-Regular Expression Notes
    U3-CFG Definition of CFG
    U3-CFG_Leftmost_Rightmost_Derivations
    U3-Parse tree
    U3- Removing ambiguity and review of all topics-21102021-1020-1120
    U3-CYK-Algorithm
    U3-Elimination of epsilon and unit productions
    U4_CFG to PDA
    U4-Construction of PDA
    U4-DPDA
    U4-PDA to CFG
    U4-PDA to CFG_Notes
    U5-Formal Def.of TURING MACHINE
    U5-Programming Techniques, Extensions, Restricted Turing Machines
    TOA Previous Question Papers
  • Next
  CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
    • Log in
      Forgot Password?
    18ITC16-IT1-Theory of Automata-5thSem-2021-22
    Home
    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-IT1-Theory of Automata-5thSem-2021-22
    8. Summary

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

    • Teacher: Ms. K. Swathi 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