kleene's Theorem part 2 with proof | State Elimination Method (urdu/hindi)

In this lecture kleene's Theorem part 2 with proof is explained. The statement of kleenes theorem part 2 is If language can be accepted by TG (Transition Graph) then it can also be expressed by RE (Regular Expression). To proof kleene's theorem part 2 we need to remember some rules. Rule 1 If a TG has more than one start states, then introduce a new start state connecting the new state to the old start states by the transitions labeled by Λ and make the old start states the non-start states. Rule 2 If a TG has more than one final states, then introduce a new final state, connecting the old final states to the new final state by the transitions labeled by Λ. Rule 3 If a state has two (more than one) incoming transition edges, then replace all these transition edges with a single transitionedge labeled by the sum (+) Rule 4 (state elimination) If three states in a TG, are connected in sequence then eliminate the middle state and connect the first state with the third by a single transition. All the rules are explained with help of examples. The conversion of transition graph in regular expression has also been explained with help of example. The state elimination method has also explained with help of example. kleene's Theorem part 2 with proof State Elimination Method kleene theorem kleene's theorem in automata #sherurecords #automatatheory #automata #kleenestheorem