Closure Under The Regular Operations

















Suppose you have NFA N1 that recognizes language A1 
and NFA N2 that recognizes language A2.


How do you construct NFA N that recognizes (A1 union A2)? (draw picture)


What does this prove?

















Suppose you have NFA N1 that recognizes language A1 
and NFA N2 that recognizes language A2.


How do you construct NFA N that recognizes (A1 concat A2)? (draw picture)


What does this prove?

















Suppose you have NFA N1 that recognizes language A1.


How do you construct NFA N that recognizes (A1*)? (draw picture)


What does this prove?