GATE CS 2017 Set 2 — Question 30

Numerical answer 1 mark Question 30 2017

Question 30

NAT 1 marks · no negative Theory of Computation

Consider the language \(L\) given by the regular expression \((a+b)^*b(a+b)\) over the alphabet \(\{a,b\}\). The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting \(L\) is ______.

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2017 Theory of Computation

Source: GATE 2017 Computer Science and Information Technology, Set 2, Q30 (question number approximate)

All Theory of Computation questions