Computer Science, asked by rajputparminder070, 5 hours ago

convert a regular expression (a+b)^*(aa+bb)(ab)^* into equivalent dfa.​

Answers

Answered by Anonymous
4

This method is given below: Step 1: Design a transition diagram for given regular expression, using NFA with ε moves. Step 2: Convert this NFA with ε to NFA without ε. Step 3: Convert the obtained NFA to equivalent DFA.

:-hope its helpful

Similar questions