PROJECT TITLE : Conversion Between Formal Languages

COUSRE NAME : Theory Of Computation

COUSRE CODE : BCS503

BRANCH : BTECH(AI)

SEMESTER : V
 CHINREDDY BHUMIKA
21TEC2CS302

KORUPROLU GOWTHAM
The team 21TEC2CS060

BHUMIREDDY
VISHNUVARDHAN REDDY
21TEC2CS080
 INTRODUCTION
REGULAR EXPRESSIONS : The regular expressions are useful for representing
certain sets of strings in an algebraic fashion. Actually these describe the
languages accepted by finite state automata

DFA (Deterministic finite automata) : Deterministic refers to the uniqueness of

the computation. The finite automata are called deterministic finite automata if
the machine is read an input string one symbol at a time.
 Conversion of Regular
Expression To DFA

STEP - 1 STEP - 2 STEP - 3

Design a transition Convert this NFA with ε Convert the obtained

diagram for given to NFA without ε. NFA to equivalent DFA.
regular expression, using
NFA with ε moves.
 EXAMPLE
Design a FA from given regular expression 10 + (0 + 11)0* 1.

Solution: First we will construct the transition diagram for a given regular expression.
Step 1:
Step 2: Step 3:

Step 4: Step 5:
Now we have got NFA without ε. Now we will convert it into required DFA for that, we will first write a
transition table for this NFA
The equivalent DFA will be:
 PROPOSED
USER INTERFACE
SOLUTION
We have built a web application
which takes input of a regular
expression and gives the
transition table of NFA & DFA
along with the diagram
website
Overview

Here we have to enter the regular expression according to the

supported language as mentioned in examples.
website
Overview

After entering the

expression tap on
convert. After that
we get the
transition table and
the DFA diagram as
solution
 CONCLUSION
So we can conclude that a robust tool with a user-friendly
interface for converting complex regular expressions into
efficient DFAs & Converting regular expressions to DFAs is a
game-changing technique that can vastly improve your coding
efficiency.