See Our team

Wondering how we keep quality?

Got unsolved questions?

Ask Questions

Engineering
GATE
CBSE
NCERT
Psychology
English
Computer
Constitution
Astrology
Yoga
Economics
Physics
Biology
Electronics
Microprocessor
Career
Interview
Anatomy
Botany

## 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 ______. -gate computer science 2017

By:satyashiromani

Taged users:

|satyashiromani|aksingh1818|Shivam-Yadav|Oshal-Borkar|Umang|ThreeRed|deepuckraj|thegdx|Aparna-Dasgupta|Manisha12|LupiN|geetika|leo|13priya|tarun101|rathinlz04|OSHO-books|shreyansh-jain|milanyoyoyogmailcom|milan-ransingh|akialwayz|iamknown|DEEPAK202|SONIKAPAL29GMAILCOM|Soma-bhattacharya|vivek25|Haider-Ali-Khan|harshshah822|Avinash-jha|vaishnavi-Deshpande

Likes:

|deepuckraj

Dislikes:

Be first to dislike this question

Talk about thisDelete|Like|Dislike|

## Answers

B) 4deepuckraj

Likes:

Be first to like this answer

Dislikes:

Be first to dislike this answer

Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|

------------------------------------

## Can you help us to add better answer here? Please see this