0 votes 0 votes Draw the DFA for (a*b +b*a) Theory of Computation theory-of-computation finite-automata + – varunraj asked Mar 17, 2018 varunraj 560 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes Not minimized Mk Utkarsh answered Mar 17, 2018 selected Mar 17, 2018 by joshi_nitish Mk Utkarsh comment Share Follow See all 3 Comments See all 3 3 Comments reply ankitgupta.1729 commented Mar 17, 2018 reply Follow Share Bro , u did not show transitions for q4 and q5.. 0 votes 0 votes Mk Utkarsh commented Mar 17, 2018 reply Follow Share i know there is no dead state in this FA but one can get the meaning out of it i think 1 votes 1 votes Mk Utkarsh commented Mar 17, 2018 reply Follow Share nvm updated :) 1 votes 1 votes Please log in or register to add a comment.
2 votes 2 votes ..... abhishekmehta4u answered Mar 17, 2018 edited Mar 17, 2018 by abhishekmehta4u abhishekmehta4u comment Share Follow See all 3 Comments See all 3 3 Comments reply varunraj commented Mar 17, 2018 reply Follow Share @abhishekmehta4u what is the flaw in previous diagram ? 0 votes 0 votes abhishekmehta4u commented Mar 17, 2018 reply Follow Share i missed one transitions function 0 votes 0 votes varunraj commented Mar 17, 2018 reply Follow Share nope ,it has all 12 transitions .i think it is correct .will you check it again . 0 votes 0 votes Please log in or register to add a comment.