Theory of Computation-Regular Languages and Finite Automata (GATE Computer Science): Questions 8 - 8 of 8

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 450.00 or

Question number: 8

» Theory of Computation » Regular Languages and Finite Automata

MCQ▾

Question

Consider the regular expression (0 + 1) (0 + 1) …. N times. The minimum state finite automation that recognized the language representation by this regular expression contains

Choices

Choice (4) Response
a.

n + 1 state

b.

n + 2 state

c.

N state

d. Question does not provide sufficient data or is vague

Sign In