operations on regular languages | Operations on Regular language in Theory of Computation

operations on regular languages | Operations on Regular language in Theory of Computation. In this theory of computation tutorial, we will learn what are the different operations we can perform on regular languages.A regular language is said to be a regular language if and only if a FSM recognizes it.
There are 3 main operation that can be performed on regular languages:
Union of Languages
Concatenation of languages
Star Operation
Union operation can be written as
AUB = {x| x∈A or x∈B}
Example: A={mn, o} B = {pq, st}
Concatenation operation can be written as
A o B = {xy | x∈A and y∈B }
Example: A={mn, o} B = {pq, st}
Star operation can be written as
A*= {x1 x2 x3 x4… xk | k≥0 and each xi∈A }
Example: A={mn, o}

Kindly Consider Subscribing to my Channel if you found this video, useful.
Thank you.
#TOC #regularlanguages #operationsonregularlanguages #FINITEAUTOMATA #DFA

[QuickCS]

Thank you for watching this video. Subscribe if you find this video useful.