Skip to main content
Home
  • Home
  • Classrooms
  • Quiz
  • Blog
  • More
    • Reach us
      • Contact Us
      • Internship
    • About
      • About Techtud
Back to Course Home
  • Unit 1 | DFA, NFA, Mealy - Moore, Regular Expression
    • Chapter -1
      DFA/ NFA
      • Basics of TOC
      • Introduction to TOC and DFA(1)
      • Some Tips
      • Deterministic Finite Automata (DFA)
      • Minimization of DFA(1)
      • DFA Minimization Notes
      • Minimization of DFA using Myhill-Nerode Theorem
      • Notes of Minimization of DFA using Myhill-Nerode Theorem
      • Property of DFA
      • Propertry of DFA (1)
      • Operations on DFA
      • Introduction to NFA
      • Examples of NFA
      • Conversion of NFA to DFA(1)
      • Some important uses of DFA and NFA
      • Epsilon NFA(1)
      • convertion of NFA to DFA(2)
      • Diffrence between DFA and NFA
      • DFA / NFA QUIZ
    • Chapter -2
      Mealy- Moore Machines, RE, Regular language
      • Basics of Regular Expersssion
      • Lecture on Regular Expressions
      • Important Opeartions and Formula
      • NFA to Regular Expression Conversion and vice versa.
      • Ardens Theorm
      • Arden's Theorm
      • RE to NFA
      • RE to NFA
      • Lecture on Closure Properties of Regular Language
      • Closure Property of Regular language
      • Lecture on NFA for a Regular Expression
      • Lecture on Regular Expression for an NFA
      • Check for Regular language and Pumping lemma
      • Introduction to Mealy and Moore Machines
      • Moore Machine and Mealy machine
      • Moore Machine and Mealy machine(1)
      • Moore Machines
      • Moore Machine and Mealy machine(2)
      • Mealy Machine
      • Moore Machine and Mealy machine (3)
      • Conversion of Moore machine to Mealy machine
      • Conversion of Moore machine to Mealy machine(2)
      • Conversion of Mealy machine to Moore machine(1)
      • 2's complement by Mealy and Moore Machine
      • Regular Grammer
    • Chapter -3
      PDA , CFL and LBA
      • Classification Of Grammer
      • Introduction To PushDown Automata
      • PDA
      • PDA Examples
      • Removal Technique
      • Linear Bounded Automata(LBA)
      • PDA, CFL and CSL
      • Context free language
      • PDA/CSL
    • Chapter -4
      Turing Machines, Decidability
      • Definition of Tuning Machine
      • Example Of Turing Machine
      • Modification to standard TM
      • Recursively Enumeration and Recursive Language
      • Recursive and Recursively enumerable languages example
      • Unrestricted Grammer
      • Countability
      • Computability and Decidability
      • Decidability
      • Decidability part 2
      • Decidability part 3
      • Decidability Table for all language.
      • Some undecidable problems based on TM halting problem
      • Turing Machine and Decidability
  • Ambikesh Kumar Singh @ambikeshkumarsingh  added a Short note
    11 Jun 2019
Important Opeartions and Formula

Here are some important tricks and formula that will help you while dealing with Regular Languages.

 

0Comment
up
0 like

Quick Links

  • Terms and Services

About

  • About Techtud

Reach us

  • Contact Us
  • Join Us

Media Coverage

TOI
YS
BS

Subscribe

Proudly supported by OpenSense Labs