1.

Identify whether the given transition diagram is NFA?

Yes

No

2.

Define a NFA that accepts only the particular string ‘ab’ for the given transition diagram.

Define a NFA that contains the string ‘ab’ as sub string for the given transition diagram.

Define a NFA that accepts the string ‘ab’ as suffix for the given transition diagram.

Define a NFA that accepts the string ‘ab’ as prefix for the given transition diagram.

identify the correct problem statement for given nfa design is?
Design a nfa that accepts either 00 or 11 over the binary alphabets

Design a nfa that accepts neither 00 nor 11 over the binary alphabets

Design a nfa that accepts exactly 00 or 11 over the binary alphabets

Design a nfa that accepts only 00 or 11 over the binary alphabets

identify the correct problem statement for given nfa design is?

Define a NFA that does not contain ‘ab’ as sub string over the alphabet {a,b}

Define a NFA that accepts only the string ‘ab’ over the alphabet {a,b}

Define a NFA that accepts the string prefix with ‘ab’ over the alphabet {a,b}

Define a NFA that contains ‘ab’ as sub string over the alphabet {a,b}

Which is the transition function of NFA?

a) Q X   Q b) Q X   2Q

c) Q X  U   Q d) Q X  Q2
The minimum number of states required to accept the language L={w|w  (a,b)* } is ___

a) 1 b) 2

c) 3 d) 4

What is the minimum number of states in the NFA accepting the language {abab n | n>=0} U
{aban n>=0}

a) 4 b) 3

c) 5 d) 6

Given an arbitrary NFA with N states, the maximum number of states in an equivalent minimized
DFA is at-least

a) n2 b) n

c) 2n c) n!

A final state as well as initial in a transition diagram is denoted by

b)
a)

c)
d)
(q,)=q #Statement 1

(q,wa)= (^(q,w)a) # Statement 2

Check the (Statement1, Statement2) status

a) true, true

b)true, false

c)false,true

d)false,false

The difference between the DFA and NDFA is

a) only in  b) only in initial state

b) only in final states d) only in transition function 

A finite state machine can recognize

a) regular grammar

b) context free grammar

c) context sensitive grammar

d) recursive grammar

when the proof of the statement is initiated by an assumption that the statement is false, the proof
technique is called

a) contrapositive

b) contradiction

c) deductive

d) converse

identify the correct statements from the following

I) A FSM can be designed to add two integers of any arbitrary length (arbitrary length of digits)

II) Every subset of a countable set is countable.

a) only I

b) only II

c) Neither I nor II

d) both I and II
The string accepted by following finite automaton are:

q
0

a) {a,aa,aaa,…} b){,a,aa,aaa,…}

c) {} d) {}

The following are DFAs for the two languages L1={w|w has exactly three a’s and L2={w|w has at
least two b’s over the alphabets {a,b}

a) false , false

b) false, ture

c)ture, false

d) true,true

Design a NFA that accepts the string who is n th symbol from end is 1 over the binary
alphabet. L={x | x is in (0,1)* where x is a string whose next to last symbol is 1}
Identify the M1 and M2 finite Automata for accepting the language L={(a,b)*abba(a,b)*}

a) M1-DFA, M2-DFA

b) M1-DFA, M2-NFA

c) M1-NFA, M2-DFA

d) M1-NFA, M2-NFA
Identify the M1 and M2 finite automata for accepting the language L={ab*a}

a) M1-DFA, M2-DFA

b) M1-NFA, M2-DFA

c) M1-NFA, M2-NFA

d) M1-DFA, M2-NFA

Design a DFA that contains the substring 101 over the binary alphabets
Design a DFA that accepts the sub string 01 over the binary alphabet