CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
  • 18ITC16-IT2-Theory of Automata-5thSem-2021-22
    0%
  • Previous
  • Course data
    General
    Announcements
    TOA-Assignment-1
    ToA Slip Test-1
    Topic 1
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210804-01-INTRODUCTION,COURSE OBJECTIVES,OUTCOMES,TERMINOLOGY
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210805-02-Finite Language,Infinite Language, Finite Automata, DFA
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210809-03-Designing DFA
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210811-04-More Examples DFA
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210812-05-ExtendingTransitionFunction,Language of a DFA
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210816-06-NFA-Examples of NFA
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210818-07-Language of NFA, Equivalence of NFA and DFA
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210819-08-NFA with Epsilon to NFA, Epsilon closure
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210823-09-NFA with Epsilon to DFA
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210825-10-NFA with Epsilon to DFA example2
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210826-11-Unit-2 Regular Expression-Introduction,Operators and building regular expressions
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210830-12-Regular Expressions more examples-Regular Expression and Finite Automata
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210902-13-DFA to RE by Eliminating States Method
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210903-14-DFA to Regular Expression
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210906-15-Regular Expression to DFA
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210908-16-Algebraic Laws for Regular Expressions
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210909-17-Pumping Lemma for Regular Languages with example
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210916-18-Closure Properties ofRegular Languages
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210917-19-Decision Properties of Regular Languages, Testing Emptiness, Membership, Equivalence of states
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-202109118-20-Minimization of DFA
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210923-21-ContextFreeGrammar, definition and examples
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210924-22-Parse Tree,Yield of a Parse tree, Ambiguous Grammar examples
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20210925-23-Doubts Clarification
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20211004-24-Removing Ambiguity from Grammar
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20211007-25-LeftmostDerivation as a way to express ambiguity, Inherent ambiguity
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20211011-26-Removing Null Productions, Unit Productions,Use less Productions
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20211013-27-Revision
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20211014-28-Chomsky Normal Form
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20211018-29-Pumping Lemma for CFL
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20211020-30-Closure Properties and Decision Properties of CFL
    AY2022-UG-SEM-5-IT2-18ITC16-TOA-SR-20211021-31&32-Push Down Automata-Definition,Graphical Notation and Examples
  • Next
  CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
    • Log in
      Forgot Password?
    18ITC16-IT2-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-IT2-Theory of Automata-5thSem-2021-22
    8. Summary

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

    • Teacher: Sri S.Rakesh 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