Question

5. Construct DFA for regular expression (a + b)* aa + aba". swer :​

Answer 1

Answer:

hi how are you are you fine

Answer 2

Answer:

In given regular expression it only accept which with string 'aa' and 'aba'.

Explanation:

DFA refers to deterministic finite automata. The finite automata are called deterministic finite automata if the machine is read an input string one symbol at a time.

• In DFA, there is only one path for specific input from the current state to the next state.
• DFA does not accept the null move, i.e., the DFA cannot change state without any input character.

• DFA can contain multiple final states. It is used in Lexical Analysis in Compiler.