Regular Language in Automata Thoery
Regular Language in Automata Thoery
Regular Languages or Formal Language : A language is regular if it can be expressed in terms of regular expression.
Closure Properties of Regular Languages
Union : If L1 and If L2 are two regular languages, their union L1 ∪ L2 will also be regular. For example, L1 = {an | n ≥ 0} and L2 = {bn | n ≥ 0} L3 = L1 ∪ L2 = {an ∪ bn | n ≥ 0} is also regular. Intersection : If L1 and If L2 are two regular…
View On WordPress













