Question

Solve Regular expression to epsilon-NFA problem For the following regular expression: (((00)*(11))|01)* Over the alphabet {0,1} Give an epsilon-NFA that recognizes the same language. HELP: Block Canvas Tutorial

Answer 1

The given regular expression is :

(((00)* (11)) | 01)*

In order to convert the regular expression to epsilon NFA, the epsilon NFA for the subexpressions should be created at first as follows :

Step 1 :

Epsilon NFA for (00)* is :

ع ليا 2 5 CO 3

Step 2 :

Epsilon NFA for ((00)* (11) is :

> 5 6 8

Step 3 :

Epsilon NFA for (((00)* (11)) | 01) is :

2 3 4 5 6 7 8 0 9

Step 4 :

The final epsilon NFA for the given regular expression (((00)* (11)) | 01)* is :

E 0 2 3 4 5 6 7 8 10 E 0 1 9