Consider the language L given by the regular expression a b ba 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

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
GATE-Computer-Science-Engineering-2017-->View question


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

A) 3
B) 4
C) 5
D) 6


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) 4
 
This explanation is contributed by Deepak Raj.

________________________________________________________________________________________________________________________________________

deepuckraj

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



Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!