0 votes 0 votes Let sigma = { a,b }. The minimal number of states in a DFA that accepts set of all strings with A) exactly 2 "a's" and more than 2 "b's". B) atleast one "a" and exactly 2 "b's" . Theory of Computation theory-of-computation finite-automata + – Vicky rix asked Apr 1, 2017 • retagged Jun 4, 2017 by Arjun Vicky rix 396 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply rude commented Apr 1, 2017 reply Follow Share there is no shortcut for this, you have draw both separately, then combine it and later minimize it. 0 votes 0 votes Vicky rix commented Apr 2, 2017 reply Follow Share @ rude can u please post the answer ... 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Answer for exactly 2 "a's" and more than 2 "b's" is 10 states. AnilGoudar answered Apr 1, 2017 AnilGoudar comment Share Follow See all 0 reply Please log in or register to add a comment.