Pumping lemma is used to prove that a language is NOT REGULAR.It cannot be used to prove that a Language is Regular. If A is a Regular Language, then A has a Pumping Length ‘P’such that any string ‘S’where |S|≥P Read more…

# Category: TOC

Theory Of Computation FINITE AUTOMATA Introduction: Basic Mathematical Notation and techniques Finite State systems, Basic Definitions, Finite Automaton : DFA Finite Automaton : NDFA, Finite Automaton with €- moves Regular Languages- Regular Expression Equivalence of NFA and DFA Equivalence of Read more…

Theory And Numerical Theory: Minimization of DFA is required to obtain the minimal version of any DFA which consists of the minimum number of states possible.suppose you designed a DFA with 5 states and your friend designed it with 4 Read more…