Two automata M and M$$

are called equivalent if T$($M$)=$ T$($M$$

$).$ The set of all languages

which can be accepted by an NFA is called regular languages. The set of regular languages is

closed under concatenation, intersection, union, Kleene$-,$ homomorphims and inverse homo$-$

morphisms. We will look into some of these operations in detail later.