1 votes 1 votes construct a dfa :all string with at-least one a and exactly two b's , Theory of Computation finite-automata + – Pravin Paikrao asked Sep 8, 2016 Pravin Paikrao 596 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes first make dfa of atleat one 'a' seprate and then make a seprate dfa of atleast 2b take cross product of states in both dfa and see the transition Shubham Pandey 2 answered Sep 9, 2016 • selected Sep 9, 2016 by Praveen Saini Shubham Pandey 2 comment Share Follow See all 0 reply Please log in or register to add a comment.