GATE 2023
August 10, 2023
Data-Interpretation
August 10, 2023
GATE 2023
August 10, 2023
Data-Interpretation
August 10, 2023

TNPSC-2017-Polytechnic-CS

Question 1
If there are ‘n’ number of states in NFA, then its equivalent DFA may contain atmost ________ number of states.
A
2n
B
n
C
n2
D
2n+1
Theory-of-ComputationFinite-Automata
Question 1 Explanation: 
If there are ‘n’ number of states in NFA ,then its equivalent DFA may contain atmost 2n number of states.
Correct Answer: A
Question 1 Explanation: 
If there are ‘n’ number of states in NFA ,then its equivalent DFA may contain atmost 2n number of states.
naveen

Related posts

January 26, 2025

Mathematical-Reasoning

Read more
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x