4 votes 4 votes How many states are there in a minimum state automata equivalent to regular expression given below? Regular expression is $a^*b(a+b)$ $1$ $2$ $3$ $4$ Theory of Computation ugcnetcse-june2019-paper2 finite-automata minimal-state-automata + – Arjun asked Jul 2, 2019 • edited Jul 19, 2019 by go_editor Arjun 4.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes The minimal automata for the regular expression : $a^*b(a+b)$ is as shown below $\therefore$ Option $C.$ $3$ is the correct answer. Satbir answered Jul 19, 2019 • edited Aug 2, 2019 by Satbir Satbir comment Share Follow See all 12 Comments See all 12 12 Comments reply Show 9 previous comments `JEET commented Dec 11, 2019 reply Follow Share @Arjun Please verify this answer once. 0 votes 0 votes Satbir commented Dec 12, 2019 reply Follow Share DFA and NFA both are automatas 0 votes 0 votes `JEET commented Dec 12, 2019 reply Follow Share Yeah, that's ok but I think we need to draw DFA only. NFA is the more simpler form. I am not sure whether its correct drawing an NFA in place of DFA 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes I think answer is four. Because it also has to reject the strings like bab,abba,etc. Akash Papnai answered Oct 13, 2019 Akash Papnai comment Share Follow See all 0 reply Please log in or register to add a comment.
