0 votes 0 votes Consider the language L represented by the regular expression 01[((10)*+111)*+0]*1 Theory of Computation gateforum-test-series theory-of-computation finite-automata + – Mk Utkarsh asked Nov 18, 2017 Mk Utkarsh 4.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes A. doesn't accept :-01 111 1 B. and c are equivalent ...bcoz..in B q3 is going to q1 from which only transition having 1 is valid ....similerly in C q3 is going to q5 (same property as q1)...B&C both are true.... hs_yadav answered Nov 18, 2017 • edited Nov 18, 2017 by hs_yadav hs_yadav comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Mk Utkarsh commented Nov 18, 2017 reply Follow Share Question didn't mentioned minimal DFA 0 votes 0 votes joshi_nitish commented Nov 18, 2017 reply Follow Share yes, therefore both B and C could be answer. 1 votes 1 votes hs_yadav commented Nov 18, 2017 reply Follow Share Mk Utkarsh thanks....now it is ok.... 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes answer is B and A both swapnil1997 answered Dec 28, 2017 swapnil1997 comment Share Follow See all 0 reply Please log in or register to add a comment.
