Scribd
Upload
48 views2 pages

Equivalence of RE and FA Tutorial

The document discusses a computer science tutorial covering regular expressions and finite automata. It provides examples of writing regular expressions for languages and languages for regular expressions, as well as tasks for drawing NFAs for given regular expressions.

Uploaded by

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

Equivalence of RE and FA Tutorial

The document discusses a computer science tutorial covering regular expressions and finite automata. It provides examples of writing regular expressions for languages and languages for regular expressions, as well as tasks for drawing NFAs for given regular expressions.

Uploaded by

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

Department of Computer Science & Engineering,

Manav Rachna University, Faridabad


Course: B. Tech. (CSE/IT)
Subject Name: TOC & CD Subject Code: CSH-209

Tutorial: 4
Name Roll No. Group No._

Date of Performance Faculty’s Signature

Learning Objective: Student shall be able to solve Equivalence of RE and FA Problems on


Application of the pumping lemma

1. Write down language for the fallowing regular expressions.


a. a*(a + b)

b. (a + b)*(a + bb)
c. (aa)*(bb)*b
2. Write down regular expression for fallowing languages.
a. L= {Strings of 0's and 1's which have at least one pair of consecutive 0's, Each such
string must have a 00 somewhere in it}
b. L= {Strings of 0's and 1's which have no pairs of consecutive 0's}.
n m
c. L={ 0 1 : (m+n) is even}
3. Make NFA’s for the regular expression given below
a. (0+1)*1 + 1*

b. 0(0+1)*1 +0*1
4. Write a regular expression for

8.

You might also like