Scribd
Upload
45 views19 pages

Understanding Regular Expressions and NFAs

The document discusses regular expressions and their equivalence with finite automata. It provides examples of converting regular expressions to finite state automata and vice versa. The key points covered are: 1) Regular expressions and finite automata are equivalent in descriptive power and can be converted between each other. 2) Rules are provided for converting an NFA to a regular expression using state elimination. 3) Examples show regular expressions for various finite state automata and finite state automata for various regular expressions.

Uploaded by

breeze
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
45 views19 pages

Understanding Regular Expressions and NFAs

The document discusses regular expressions and their equivalence with finite automata. It provides examples of converting regular expressions to finite state automata and vice versa. The key points covered are: 1) Regular expressions and finite automata are equivalent in descriptive power and can be converted between each other. 2) Rules are provided for converting an NFA to a regular expression using state elimination. 3) Examples show regular expressions for various finite state automata and finite state automata for various regular expressions.

Uploaded by

breeze
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Regular Expression

Lecture 4
Topics

• Introduction to Regular Expression


• RE & NFA
• NFA & RE
• Regular Languages
• Pumping Lemma for Regular Languages

Source:"Introduction to automata theory, languages and computation" 


by JE Hopcroft, R Motwani and JD Ullman.

Module Code and Module Title Title of Slides


Regular Expression

It is a sequence of characters that define a search


pattern. Used in pattern matching with strings,
or string matching.

Eg: "find and replace"-like operations.


Text Editors

Module Code and Module Title Title of Slides


Equivalence with Finite Automata

• Regular Expressions (RE) and finite automata are


equivalent in their descriptive power.

• Any RE can be converted in to a finite automaton that


recognize the language it describes.

Module Code and Module Title Title of Slides


Regular Expression

Module Code and Module Title Title of Slides


NFAs & Regular Expressions
• For any regular expression, we can find an equivalent
NFA
1)
XUY
or
2) x X+Y

Module Code and Module Title Title of Slides


NFAs & Regular Expressions

3) X Y

XY

X*
4)
X

Module Code and Module Title Title of Slides


Rules for Regular Expression
State Elimination Method
Rule 1:Add new Initial state
• Initial state should not have any incoming
edge.
q0 q1

q0
ε q1 q2

Add Epsilon and change the initial state


Module Code and Module Title Title of Slides
Rules for Regular Expression
Rule 2:Add new final state
• Final state should not have any outgoing
edges.

ε
Module Code and Module Title Title of Slides
Rules for Regular Expression
• Rule 3:Eliminate more number of final state
• Rule 4:Eliminate all the other states one
by one except initial and final state

ε
ε

ε
Module Code and Module Title Title of Slides
Example 1- FA to RE
a

RE : a + b + c
Module Code and Module Title Title of Slides
Example -2
b

a c

RE : ab* c
Module Code and Module Title Title of Slides
Example -3

0
0
ε

1
RE: 0(01)*

Module Code and Module Title Title of Slides


Example-4

b
ε
a c
ε
d
ε

RE: a(b+c+d)

Module Code and Module Title Title of Slides


Example-5

0 0
ε
1

ε 1

RE: (10*1+0)*
Module Code and Module Title Title of Slides
Example-6
0
0 0

ε
1 1

RE: (10*10*1+0)*
Module Code and Module Title Title of Slides
Example-7

NFA:

Eliminate q1, paths eliminated are:


s → q1 → q3 and q2 → q1 → q3 that gives

Module Code and Module Title Title of Slides


Example-7
• Eliminating q2 (path q3 → q2 → q3)

• Produce

Module Code and Module Title Title of Slides


Example-7
• Eliminating q3

• Gives

L(M) = 0*1(0 + 10*10*1)*

Module Code and Module Title Title of Slides

You might also like