0 votes 0 votes How many states will have the minimal DFA accepting the language L={w|wϵ{0,1}* and contains atleast one 0 and two 1's} a) 6 b)7 c)8 d)12 Revathy Sudheesh asked Oct 4, 2017 Revathy Sudheesh 652 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes 6 States LeenSharma answered Oct 4, 2017 LeenSharma comment Share Follow See all 4 Comments See all 4 4 Comments reply Revathy Sudheesh commented Oct 4, 2017 reply Follow Share Ok. Now got it. Thank you. 1 votes 1 votes hungrysoul554 commented Jan 14, 2018 reply Follow Share how to solve these kind of problems we have to do trail and error ? 0 votes 0 votes Sumaiya23 commented Jan 24, 2018 reply Follow Share In such questions where we the number of states in minimal DFA are asked, do we have to count the trap state also? 0 votes 0 votes akshat sharma commented Jan 24, 2018 reply Follow Share in such question not required of trap state use GRID METHOD mention in above answer see word AND is using concatenation of two language then use grid method 0 votes 0 votes Please log in or register to add a comment.