Question

Construct FA for regular expression (a+b)*+ab*​

Answer 1

Explanation:

We can use Thompson's Construction to find out a Finite Automaton from a Regular Expression. We will reduce the regular expression into smallest regular expressions and converting these to NFA and finally to DFA.

Some basic RA expressions are the following −

Case 1 − For a regular expression ‘a’, we can construct the following FA −

MARK ME AS BRALIST