Question

Define Thompson's Construction rules also convert (ba*(a+b))" to e-NFA using Thompson's Construction rule. ​

Answer 1

Thompson algorithm, is a method of transforming a regular expression into an equivalent nondeterministic finite automaton (NFA). This NFA can be used to match strings against the regular expression