Scribd
Upload
13 views1 page

Tutorial - DFA NFA

Great source for practice

Uploaded by

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

Tutorial - DFA NFA

Great source for practice

Uploaded by

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

RV COLLEGE OF ENGINEERING

Autonomous Institution affiliated to VTU


V Semester
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION (21CS54)

Tutorial-

1. Define the language accepted by a DFA.


2. Explain briefly any two applications of FA.
3. Write the formal definitions of a NFA.
4. For the following transition table of NFA, check whether the string 01011 is accepted or
not, if q0 is the start state and q1 is the final state. Trace.

0 1 ε

->q0 { q1 } { q1 } { q2}

*q1 { q 0, q2 } { q1 } { q2 }

q2 - { q1 } -

5. (a) Construct a NFA that accepts all strings of 0’s and 1’s such that the second symbol
from the right end is a 1.
(b) Convert this NFA into equivalent DFA.
6. (a) Design a DFA to accept all strings of a’s and b’s such that the strings are of the form (abb)n :
n>=1
(b) Design a DFA to accept all ternary strings(base 3) strings divisible by 4.
7. (a) Differentiate between DFA,NFA and ε- NFA.
(b) Write the extended Transition function of NFA.

You might also like