Math and science::Theory of Computation
Regular language operators
Let
- Union
(i.e. as per standard axiom of union for sets)- Concatenation
- Star
The class of regular languages is closed under these three operations!
Visual Justification
It is quite easy to grasp how regular languages are closed under the above
three operations. To do so, consider the state diagrams representing two
nondeterministic finite automata
Union,
The set of start states is the union of the start states of
Concatenation,
Each accept state of
Star operator,
Each accept state of
Source
Introduction to the Theory of Computation, Sipserp44