Answer:
We assume that the NFA for the expression S is theorem by using the expressions given below.
Cases as
- NFA for empty-expression is ε
- NFA for symbol is a
- NFA for union expression is a|b
- NFA for concatenation expression is ab
- NFA for Kleene star expression is a*
Thompson's Construction Algorithm proves that any expression can be expressions in the NFA's.
