A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Consider the regular expression (a + b) (a + b) … (a + b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains
a. n states
b. n + 1 states
c. n + 2 states
d. 2^n states
Answer:n + 1 states
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: