CREATE OWN LIBRARY

Regular Expressions

 

Definition:

 

We can write a language by a mathematical expression. Regular expression is an expression for Regular Language. 

If we can able to write a regular expression for a language then obviously it is regular language

Or, we can say only for the regular language we can write a regular expression

 

Finite State Machine computes only Regular grammar and Regular language.

One language can say regular language if we write a Regular expression for it.

 

A more than one regular expression can exist for a regular language.

 

 

But one regular expression has one language.

 

 

One Regular language has more than one Regular expression and for every regular expression, we design a single machine. So, one regular language has more than one machine.

 

 

But every machine has one language. So, we can say another theory that more than one regular expression can exist for a machine.