Hi Students

This is handmade notes of Regular Language & Finite Automata in Theory of Computation

Content:

• Tractable Problem
  
• DFA & NFA Specification
  
• Pumping Lemma
  
• Kleene's Theorem
  
• FA Design
  
• Types of state in FA
  
• Length Machine
  
• Regular Expression
  
• Design of Regular Expression
  
• Regular Expression
  
• Solving Grammar
  
• Linearity of a Grammar
  
• Algorithm in FA
  
• Minimization of DFA
  
• Infinite Intersaction & Union
  
• Closure Properties
  
• HomoMorphism of Language
  
• Application & Variation of FA
  
• Transducer
  
• Non-Standard Function
  

         (with Example)

NOTE: If this is helpful for you then don't forget to post some more useful stuff here.

Thanks
Dipesh