Multiple Choice
How many states are present in the minimum state finite automaton that recognizes the language represented by the regular expression (0+1) (0+1) …..N times?
A) n+1
B) n+2
C) n
D) 2n
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q13: The set which is not countable if
Q14: What is the reason behind a Turing
Q15: The number of symbols necessary to simulate
Q16: If a Turing machine halts for each
Q17: Which of the following statement is wrong?<br>A)power
Q18: A pushdown automata behaves like a Turing
Q19: Church's Thesis supports<br>A)a turing machine as a
Q20: We think of a Turing machine's transition
Q21: Four pairs are following; in each pair
Q23: Consider the state table of a finite