NFA for the regular expressions

Properties of Regular Languages 1. Closure Properties Regular languages are closed under operations like union, concatenation, and Kleene star. Union: If L1 and If L2 are two regular languages, their union L1 ? L2 will also be regular. Intersection: If L1 and If L2 are two regular languages, their intersection L1 ? L2 will also be regular. Concatenation: If L1 and If L2 are two regular languages, their concatenation L1.L2 will also be regular. Kleene Closure: If L1 is a regular language, its Kleene closure L1* will also be regular. Complement: If L(G) is regular language, its complement L’(G) will also be regular. Complement of a language can be found by subtracting strings which are in L(G) from all possible strings.