Scribd
Upload
17 views

Toc Tutorial2

Uploaded by

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

Toc Tutorial2

Uploaded by

vanshrastogi1513
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

SIR M.

VISVESVARAYA INSTITUTE OF TECHNOLOGY


Department of Computer Science and Engineering
Accredited by NAAC | Approved by AICTE New Delhi | Affiliated to VTU, Belagavi,

Krishnadevaraya Nagar, Bengaluru-562157

COURSE/CODE: THEORY OF COMPUTATION/ BCS503


CLASS/SECTION: V sem
TUTORIAL-2

1. Discuss Regular expression. Write the regular expression for the following languages:
i)Representing for strings of a’s and b’s having odd length.
ii)To accept strings of a’s and b’s such that third symbol from the right is a and fourth symbol
from the right is b.

2. Interpret a diagram for a regular expression for the given DFA

3. Write Regular Expression for the language that has the set of all strings of 0’s and 1’s not
containing 101 as a substring.

4. Write Regular Expression for the language that have the set of all strings of 0’s and 1’s such that
no prefix has two more 0’s than 1’s, not two more 1’s than 0’s.

5. Write Regular Expression for the language that have the set of all strings of 0’s and 1’s whose no
of 0’s is divisible by 5 and no of 1’s is even.

6. Construct an NFA equivalent to (0+1)*(00+11)

7. Construct an NFA equivalent to the regular expression ((0+1)(0+1)(0+1))* b)

8. Construct an NFA equivalent to 10+(0+11)0*1

9. Obtain the regular expression that denotes the language accepted by the following DFA.
10. Construct an NFA equivalent to the following regular expression ((10)+(0+1) 01.

11.

You might also like