0 votes 0 votes What is the regular expression corresponding to the above DFA? $(01 + (00)^*1)^*$ $0^*10^*$ $(10 + 0(00)^* (1 + 01) )^*$ $0(00)^*10^*$ Theory of Computation tbb-toc-2 theory-of-computation finite-automata regular-expression + – Bikram asked Aug 12, 2017 • retagged Sep 17, 2020 by ajaysoni1924 Bikram 285 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes A) fails on 1 B) fails on 1 C) pass D) fails on 00010 varunbhatt21 answered Sep 13, 2017 • selected Aug 19, 2019 by Bikram varunbhatt21 comment Share Follow See all 2 Comments See all 2 2 Comments reply kamakshi commented Oct 4, 2017 reply Follow Share will the machine accepts null also? 0 votes 0 votes varunbhatt21 commented Oct 5, 2017 reply Follow Share you mean epsilon ,....... yes it is accepting epsilon as starting state is the final state 0 votes 0 votes Please log in or register to add a comment.