FLAT

      




Chapter 1: Introduction
       Topics :(3 Lectures)
YouTube Video
  Basic Concepts of Automata                                   
Chapter 2: Finite Automata Without Output
         Topics :(xx Lectures)
        a) Using Partition method
        b) Using Table Filling method
Chapter 3: Finite Automata with Output
        Topics: (xx lectures)
  Introduction to Moore and Mealy Machines
  Construction of Mealy Machine
  Construction of Moore Machine
  Conversion of Moore to Mealy Machine
  Conversion of Mealy to Moore Machines
Chapter 4: Epsilon NFA
        Topics: (xx lectures)

   Introduction to Epsilon NFA
   Conversion of Epsilon NFA to NFA  
Chapter 5: Regular Expressions
        Topics: (xx lectures)

  Introduction to R.E. and Identity Laws
  Arden’s Theorem: FA to R.E. Conversion
  Thomson’s Construction: R.E. to FA conversion
  Pumping Lemma for Regular Languages
Chapter 6: Pushdown Automata
        Topics: (xx lectures)

  Introduction to PDA                                                            
  Construction of PDA from  CFL
  PDA Construction Examples
  Deterministic PDA
  Conversion of CFG to PDA
  Conversion of PDA to CFG
Chapter 7: Turing Machine
         Topics: (xx lectures)

  Introduction to Turing Machines
  Construction of Turing Machines Examples
  Types of Turing Machines

Comments

Post a Comment

Search related post on google