Regular Expression to NFA-  (a+ba) * a

First Parsing Step concatenate (a+ba) * a

Second Parsing Step concatenate *a a+ba

Third Parsing Step concatenate *a + aba

Fourth Parsing Step concatenate *a + a ba

Identify Leaf Nodes concatenate +a + a ba

Convert Leaf Nodes concatenate * + This conversion corresponds to the base case in the transformation algorithm a a a b

Identify Convertible Node(s) concatenate * + a a a b Conversion Rule: Concatenation

Convert Node concatenate * + a aab Conversion Rule: Concatenation

Identify Convertible Node concatenate * + a aab Conversion Rule: Union

Convert Node concatenate * a a ab Conversion Rule: Union

Identify Convertible Node concatenate * a a ab Conversion Rule: Kleene Closure

Convert Node concatenate a Conversion Rule: Kleene Closure a ab

Identify Convertible Node concatenate a Conversion Rule: Concatenation a ab

Convert Final Node a Conversion Rule: Concatenation a ab