and
N
to show that Regular Languages are closed under union, concatination and star.
The illustrations below are meant to indicate how one can construct NDFA out
of components
Nand
N
to show that Regular Languages are closed under union, concatination and star.
_________________________________________________________________
THE UNION
_________________________________________________________________
THE CONCATENATION
_________________________________________________________________
THE STAR
