Mathematical Proof that Regular Languages are Closed under Reversal

A language is regular if it can be expressed in terms of regular expressions. The article focuses on discussing the mathematical proof of the fact that Regular Languages are closed under reversal. 

Regular Languages generally have three basic definitions:

1. Regular Languages are those Languages that have a Regular Expression to represent them.
2. Regular Languages are those Languages that have a regular grammar defined on them.
3. Regular languages are those languages for which a finite automaton can be created.

We know that these regular languages are closed under union, reversal, etc. 

Proof: 

Let L be a  regular language, and M be an NFA that accepts it.

M = (Q, Σ, δ, q₀, {q_f})

Here,

Q = Set of states in the finite automata
Σ = alphabet 
δ = Transition
q₀ = Initial State
F = {q_f} = Set of final States

We construct M^R

M^R = (Q, Σ, δ^R, q_f , {q₀})

Here,
δ^R is δ with the direction of all the arcs reversed.

There is a path from q₀ to q_f in M if and only if there is a path from q_f to q₀ in M^R.

This implies that:

L(M^R) = L^R   

Thus, it is proved that L is closed under reversal.

My Personal Notes arrow_drop_up

Save