0 votes 0 votes Let L be the language formed by L={anb | n>=0}. Find a DFA that accepts L2-L. Theory of Computation finite-automata + – BASANT KUMAR asked Jul 19, 2018 edited Jul 20, 2018 by Prashant. BASANT KUMAR 372 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes 4 state is requited. abhishekmehta4u answered Jul 19, 2018 abhishekmehta4u comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments abhishekmehta4u commented Jul 20, 2018 reply Follow Share In toc L^2= L concatanation L (L.L) 1 votes 1 votes BASANT KUMAR commented Jul 20, 2018 reply Follow Share if i do minor modification like find a dfa for L^2-L(complement).what will be no. of state in minimal dfa?? 0 votes 0 votes Harshitha 123 commented Jul 20, 2018 reply Follow Share Thanks I understood 0 votes 0 votes Please log in or register to add a comment.