Chapter 2 – DFA & NFA
Multiple Choice Question
1. Given:
L1= {xϵ ∑*|x contains even no’s of 0’s}
L2= {xϵ ∑*|x contains odd no’s of 1’s}
No of final states in Language L1 U L2?
(A) 1
(B) 2
(C) 3
(D) 4
Answer: (c) 3
2. The maximum sum of in degree and out degree over a state in a DFA can be
determined as:
∑= {a, b, c, d}
(A) 4+4
(B) 4+16
(C) 4+0
(D) Depends on language
Answer: (D) Depends on language
3. The sum of minimum and maximum number of final states for a DFA n states is equal
to:
(A) n+1
(B) n
(C) n-1
(D) n+2
Answer: (A) n+1
4. Which of the following options is correct?
Statement 1: Initial State of NFA is Initial State of DFA.
Statement 2: The final state of DFA will be every combination of final state of NFA.
(A) Statement 1 is true and Statement 2 is true
(B) Statement 1 is true and Statement 2 is false
(C) Statement 1 can be true and Statement 2 is true
(D) Statement 1 is false and Statement 2 is also false
Answer: (A) Statement 1 is true and Statement 2 is true
5. Given Language: L= { ab U aba }*
If X is the minimum number of states for a DFA and Y is the number of states to
construct the NFA,
|X-Y|=?
(A) 2
(B) 3
(C) 4
(D) 1
Answer: (A)
6. If NFA of 6 states excluding the initial state is converted into DFA, maximum possible
number of states for the DFA is ?
(A) 64
(B) 32
(C) 128
(D) 127
Answer: (C)
7. NFA, in its name has ’non-deterministic’ because of :
(A) The result is undetermined
(B) The choice of path in not deterministic
(C) The state to be transited next is not deterministic
(D) All of the above
Answer: (B)
8. Given Language L= {xϵ {a, b}*|x contains aba as its substring}
Find the difference of transitions made in constructing a DFA and an equivalent NFA?
(A) 2
(B) 3
(C) 4
(D) Cannot be determined
Answer: (A)
9. Number of states require to accept string ends with 101.
(A) 3
(B) 4
(C) 2
(D) Can’t be represented
Answer:- (B)
10. Two finite states are equivalent if ?
(A) Both are final states
(B) Both are non – final states
(C) Both have same number of states as well as transitions
(D) Both A & B
Answer:- (D)
Fill in the Blanks
1. Finite state machine is ___________tuple machine.
Answer :- 5
2. Finite automata needs minimum _______ number of stacks.
Answer :- 0
3. Φ in minimal finite automata need _____________ no. of final states
Answer:- 0
4. The finite automata is called NFA when there exists____________ for a specific
input from current state to next state
Answer:- Multiple Paths
5. ε-closure of state is combination of self state and ________________
Answer:- ε-reachable state
6. L={ε, a, aa, aaa, aaaa,........} is represented by ______________
Answer:- a*
7. The generators of languages are ________________ .
Answer:- Grammar
8. No. of states in minimal DFA which accepts string starting with “a” and ending
with “a”.
Answer:- 3
9. No. of states in minimal DFA which accepts string starting with “a” and ending
with “b”.
Answer:- 4
10. No. of states in minimal DFA which accepts string starting with “101”.
Answer:- 5
Short Answer Questions :-
1. Define DFA.
Keywords :- only one state
2. Define NDFA.
Keywords:- mutiple state
3. Define Language in Theory of Automata.
Keywords:- Certain rules
4. What are the steps to be followed in order to construct a DFA?
Answer:- Recognize, Minimum string, DFA design
5. No of states are there in ending with “b” machine?
Answer:- DFA construction
Long Answer Question-
1. Give Applications of Finite Automata.
2. Obtain a DFA to accept strings of a’s and b’s starting with the string ab
3. Define NFA. With example explain the extended transition function
4. Obtain DFAs to accept strings of a’s and b’s having exactly one a
5. Prove Theorem of Equivalence between DFA and Regular Expression.
