CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
  • Theory of Automata - IT1 - V Sem - 2020-2021
    0%
  • Previous
  • Course data
    General
    Announcements
    Online classes
    U1-Introduction to automata_Part1_120820_1300_1400
    U1-Introduction to automata_Part2_120820_1300_1400
    U1-Central_concepts_of_TOA_13082020_1100
    U1_Finite Automata_14082020_1300
    U1_DFA_Problems_Extended_transition_Function_19082020_1300
    U1_NFA, Problems on NFA, Extended transition function_20082020_1100
    U1-NFA_NFA2DFA_Subsetmethod_21082020_1300
    U1_NFA2DFA Problems_Epsilon NFA_26082020_1300
    U1_Epsilon_Closure_Problems_27082020_1100
    U1-Eliminating_epsilon_moves_28082020_1300
    U1-Epsilon NFA to DFA_02092020_1300
    U2-Regularexpressions_03092020_1100
    U2_DFA to Regular expressions_04092020_1300
    U2-DFA to Regular expression Problems_09092020_1300
    U2-DFA_to_RE_State_Elimination_11092020_1300
    U2_Algebraic laws_Regular_Pumping_lemma_16092020_1300
    U2-ClosureProperties of RL_17092020_1100
    U2-Decision_Properties of RL_17092020_1430
    U2-Minimization of Deterministic Finite Automata_18092020_1300
    U2-Problems on Minimize using table filling method_23092020_1300
    U3-CFG: Definition of CFG_24092020_1100
    TOA Sliptest-1 Solutions_25092020_1300
    U3-CFG_Leftmost_Rightmost_Derivations_30092020_1300
    U3-Parse tree_01102020_1100
    U3-Normal Forms for Context-Free Grammars: Eliminating Useless Symbols_07102020_0930
    U3-Elimination of epsilon and Unit Productions
    U3-Chomsky Normal Form_ 09102020_1300
    U3-GNF,Pumping lemma for CFL_21102020_1300
    U3- Closure Properties of CFL_22102020_1100
    U3-CYK-Algorithm_23102020_1300
    U3-More Problems on CFG_28102020_1300
    U4-Construction of PDA_29102020_1100
    U4-CFG to PDA_04112020_1300
    U4-PDA to CFG_05112020_1300
    U4-DPDA_06112020_1300
    U5-Formal Def.of Turing Machine_11112020_1300
    U5-Problems on Turing machines_12112020_1100
    U5-Multiplication on Turing Machines_13112020_1300
    TOA-Slip Test-2
    U5-Programming Techniques, Extensions, Restricted Turing Machines_18112020_1300
    U5-Undecidability_19112020_1100
    TOA Assignment-2
    Previous question Papers_20112020_1300
    Material
    Theory of Automata text book
    U1-Introduction to theory of automata_120820_1300
    U1-Central_concepts_of_TOA_13082020_1100
    U1_Finite Automata_14082020_1300
    U1_DFA_Problems_Extended Transition function_19082020_1300
    TOA_ Assignment-1
    U1-NFA_NFA2DFA_Subsetmethod_21082020_1300
    U1_NFA2DFA Problems_Epsilon NFA_26082020_1300
    U1_Epsilon_Closure_Problems_27082020_1100
    U1-Eliminating_epsilon_moves_28082020_1300
    U2-Regularexpressions_03092020_1100
    U2_DFA to Regular expressions_04092020_1300
    U2-DFA_to_RE_State_Elimination_11092020_1300
    U2_Algebraic laws_Regular_Pumping_lemma_16092020_1300
    U2-ClosureProperties of RL_17092020_1100
    U2-Decision Properties_17092020_1430
    U2-Minimization of Deterministic Finite Automata_18092020_1300
    U2-Problems on Minimize using table filling method_23092020_1300
    U3-CFG: Definition of CFG_24092020_1100
    TOA Slip Test-1
    U3-CFG_Leftmost_Rightmost_Derivations_30092020_1300
    U3-Parse tree_01102020_1100
    U3-Elimination of epsilon and unit productions_08102020_1100
    U3-CYK-Algorithm_23102020_1300
    U4-Construction of PDA_29102020_1100
    U4_CFG to PDA_04112020_1300
    U4-PDA to CFG_05112020_1300
    U4-PDA to CFG_Notes_05112020_1300
    U4-DPDA_06112020_1300
    U5-Formal Def.of TURING MACHINE_11112020_0930
    U5-Multiplication on Turing Machines_13112020_1300
    U5-Programming Techniques, Extensions, Restricted Turing Machines_18112020_1300
  • Next
  CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
    • Log in
      Forgot Password?
    Theory of Automata - IT1 - 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 - IT1 - V Sem - 2020-2021
    8. Summary

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

    • 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