Examples of Constructing NFA from a reg. expr
Examples of Constructing NFA from a reg. expr
A NFA for a regular expression can be constructed
as follows:
1. There is a single transition labeled with an alphabet.
(this includes an epsilon symbol). There are two states,
the start state and the final state and one edge/transition.
2.For E1.E2, construct a new start state and a new final state.
From the start state, add an edge labeled with epsilon
to start state of E1. From the final state of E1, add an
epsilon transition to Start state of E2.