0 votes 0 votes To Convert regular expression to DFA -> In most of the RE we can not directly convert it to DFA we have to first converting it to NFA-null then NFA-without null and then DFA and that takes too much time to me plz tell me any short cut to do this if any else conform me this is the only way. Theory of Computation regular-expression finite-automata theory-of-computation + – Ronak520 asked Apr 1, 2017 • retagged Jun 4, 2017 by Arjun Ronak520 488 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Tesla! commented Apr 2, 2017 reply Follow Share It is not easy but you can do it just by looking aat regular expression, first practice lots of general regular expression once you have done enough you will discover little tricks by yourself, it requires your aptitude 0 votes 0 votes Ronak520 commented Apr 2, 2017 reply Follow Share Thank you so much 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes There is no shortcut for that based on your practice u can do that easily Deepthi_ts answered Apr 11, 2017 Deepthi_ts comment Share Follow See all 0 reply Please log in or register to add a comment.