0 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 910 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
2 2 votes 4 state is requited. abhishekmehta4u answered Jul 19, 2018 abhishekmehta4u comment Share Follow See all 5 Comments 5 5 Comments reply Harshitha 123 commented Jul 20, 2018 reply Follow flag If it is L^2 why can't it be (a^nb)^2 0 0 replyShare Prashant. commented Jul 20, 2018 reply Follow flag you can expand (an b)2 =(an b) .(an b) =an b an b 0 0 replyShare abhishekmehta4u commented Jul 20, 2018 reply Follow flag In toc L^2= L concatanation L (L.L) 1 1 replyShare BASANT KUMAR commented Jul 20, 2018 reply Follow flag if i do minor modification like find a dfa for L^2-L(complement).what will be no. of state in minimal dfa?? 0 0 replyShare Harshitha 123 commented Jul 20, 2018 reply Follow flag Thanks I understood 0 0 replyShare Please log in or register to add a comment.
