CSE322 Finite Automata and Regular Expressions Lecture 9 PDF

CSE322 CONSTRUCTION OF FINITE AUTOMATA EQUIVALENT TO REGULAR EXPRESSION Lecture #9 STEPS PROBLEM SOLUTION SOLUTION SOLUTION  CSE322 EQUIVALENCE OF TWO FINITE AUTOMATA AND REGULAR EXPRESSION Lecture #9 EQUIVALENCE OF TWO FINIT...

CSE322 CONSTRUCTION OF FINITE AUTOMATA EQUIVALENT TO REGULAR EXPRESSION Lecture #9 STEPS PROBLEM SOLUTION SOLUTION SOLUTION  CSE322 EQUIVALENCE OF TWO FINITE AUTOMATA AND REGULAR EXPRESSION Lecture #9 EQUIVALENCE OF TWO FINITE AUTOMATA Two finite automata are over∑ are equivalent if they accept the same set of string over input ∑. When two finite automata are not equivalent ,there is some string w over ∑ satisfying the following: one automaton reaches a final state on application of w, whereas other automaton reaches a non final state. CASES PROBLEM SOLUTION EQUIVALENCE OF TWO REGULAR EXPRESSION The regular expressions P and Q are equivalent iff they represent the same set. Also, P and Q are equivalent iff the corresponding finite automata are equivalent. PROBLEM PROVE (a+b)*=a*(ba*)* SOLUTION Closure properties of Regular set Set Union Concatenation Closure(iteration) Transpose Set intersection Complementation