1 votes 1 votes Find the DFA corresponding to the given regular expression (0+11(01)*1)* Theory of Computation gateforum-test-series theory-of-computation finite-automata + – Mk Utkarsh asked Jan 3, 2018 Mk Utkarsh 985 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes If input is symbol 0, option B will NOT accept If input is symbol 0, option C also will NOT accept Option A will accept (0+11(01)*)* Easy one :) sh!va answered Jan 3, 2018 sh!va comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Mk Utkarsh commented Jan 3, 2018 reply Follow Share do gate questions play these tricks? :p 0 votes 0 votes Anu007 commented Jan 3, 2018 reply Follow Share I think there is nothing wrong with question. Question ask about DFA but NFA given , to gift marks 0 votes 0 votes Mk Utkarsh commented Jan 3, 2018 reply Follow Share the same gift acts as a trap :| 0 votes 0 votes Please log in or register to add a comment.