0 votes 0 votes How to draw a DFA for the below language. $L$ = {$W | W \in$ $ (0, 1)^* $}; $W$ ends with 0 and contains the substring 100 } No. of states in minimal DFA. Theory of Computation theory-of-computation finite-automata + – CSHuB asked Jan 24, 2019 CSHuB 551 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Sasta_yoda commented Jan 24, 2019 reply Follow Share This can be done with 4 states 0 votes 0 votes CSHuB commented Jan 24, 2019 reply Follow Share @Sasta_yoda Can you please make the DFA for the same? I want the DFA, please. 0 votes 0 votes CSHuB commented Jan 24, 2019 reply Follow Share @Sasta_yoda Also, answer given is 5. 0 votes 0 votes Sasta_yoda commented Jan 24, 2019 reply Follow Share Sorry man, can't draw the entire dfa from my phone. But I can tell u this, just fit the string 100 between 4 states and adjust the transitions accordingly. You won't need trap state in this dfa 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes this will require minimum 5 states Qwaszx answered Jan 25, 2019 Qwaszx comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 5 states Mk Utkarsh answered Jan 26, 2019 Mk Utkarsh comment Share Follow See 1 comment See all 1 1 comment reply smsubham commented Mar 6, 2020 reply Follow Share Why we need 5th state? Cannot we take 1 transition to Q2 from Q3? 0 votes 0 votes Please log in or register to add a comment.
