Hi,

Do you know how to construct the NFA (Non-Deterministic Finite Automata) for Regular Expression (a+). a+ means positive closure.