1 votes 1 votes Provide dfa for the below regular expression Theory of Computation theory-of-computation regular-expression + – Ayush Upadhyaya asked Mar 12, 2017 Ayush Upadhyaya 650 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Check this DFA!! sh!va answered Mar 13, 2017 sh!va comment Share Follow See all 2 Comments See all 2 2 Comments reply Vishal Goyal commented Jun 22, 2017 reply Follow Share can u explain how did u do in detail plzzzz 0 votes 0 votes Vishal Goyal commented Jun 22, 2017 reply Follow Share i think this is wrong becouse in regular expression it ends with a or aa but in u r dfa it acccepts any no of a's at the last so i think this is wwrong 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes plzz check this ans Vishal Goyal answered Jun 22, 2017 Vishal Goyal comment Share Follow See 1 comment See all 1 1 comment reply RohitKumarSingh commented Sep 14, 2018 reply Follow Share This is not a DFA at all. From F state , there are two transition for a. Please redraw without multiple transitions. 0 votes 0 votes Please log in or register to add a comment.