Closure Properties
If DFAs recognize the languages that are obtained by applying an operation on the DFA recognizable languages then DFAs are said to be closed under the operation. The DFAs are closed under the following operations.
- Union
- Intersection
- Concatenation
- Negation
- Kleene closure
Since DFAs are equivalent to nondeterministic finite automaton(NFA), the above closures are proved using closure properties of NFA.
Read more about this topic: Deterministic Finite Automaton
Famous quotes containing the word properties:
“A drop of water has the properties of the sea, but cannot exhibit a storm. There is beauty of a concert, as well as of a flute; strength of a host, as well as of a hero.”
—Ralph Waldo Emerson (1803–1882)