Wednesday, 14 May 2014

Finite Automata corresponding to Regular Expression

Finite Automata corresponding to Regular Expression:

For making the finite automata corresponding to regular expression, we have to take the advantage of following automatas - 

1.    R = ^         


2.    R = Ǿ


3.       R = a



4.    R = a*




5.    R = a + b



6.    R = a.b


with the help of these six automatas, we can create finite automata corresponding to regular expression.

Examples in the next post..... enjoy:)




Note: pictures are taken from KLP mishra book scanning.