[go: up one dir, main page]
Scribd
Upload
14 views1 page

TOC Assignment 1 QP

Research paper

Uploaded by

ashishlakhimale23
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
14 views1 page

TOC Assignment 1 QP

Research paper

Uploaded by

ashishlakhimale23
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/ 1

CAYMET’s

SIDDHANT COLLEGE OF ENGINEERING, SUDUMBARE


Department of Computer Engineering
Assignment 1

Sub: TOC Date:- 22/ 08 /2024


Sub Code: 310242© Class:- TE (COMP.Engg.)
Faculty In-charge: Prof. Prachi Hinge Max Marks: 20

1. a
. 3
Define the following terms with example: CO1

(i) DFA
(ii) NFA
(iii) Epsilon NFA

b. Construct NFA with ε moves which accepts a language consisting the string 3 CO1
of any number of a’s followed by any number of b’s , followed by any number
of c’s.

c. Construct a Mealy Machine which is equivalent to the Moore Machine 3 CO1


given in the following table.

Present state Next State Output


a=0 a=1
 q0 q3 q1 0
q1 q1 q2 1
q2 q2 q3 0
q3 q3 q0 0

2. a. Using the pumping lemma for the regular set , prove that 4 CO2
L={am bn} is not regular.
b. Convert the following regular expression to epsilon-NFA and find the e- 3 CO2
closure of all the states. (0+1)*.1.(0+1)

c. Determine a regular expression over the alphabet Σ={a,b} 4 CO2

(i) All strings that contain an even number of ‘b’s.


(ii) All strings that do not end with ‘aa’.

You might also like