0 votes 0 votes $Que-$ The minimum number of states in the $NFA$ for the regular expression $(a + a(b + aa)*b)* a(b + aa)*a$ is ______. Approach ? Theory of Computation testbook-test-series theory-of-computation minimal-state-automata + – Soumya29 asked Jan 6, 2019 • edited Mar 9, 2019 by ajaysoni1924 Soumya29 584 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments Soumya29 commented Jan 6, 2019 reply Follow Share Ok.. Thanks @Shobhit 0 votes 0 votes anjali007 commented Jan 6, 2019 reply Follow Share @Soumya29 I first made the NFA for the smallest string that the given regular expression was accepting and then completed it as to accept the other strings also.. So I guess for the minimum no of states of a particular NFA we should see the minimum no of states required to accept the string of minimum length and then proceed with the necessary modifications. 1 votes 1 votes Joey commented Nov 25, 2020 i edited by Joey Nov 25, 2020 reply Follow Share I don’t think this DFA is correct. For example, the string ‘aaababababa’ will be accepted by this NFA whereas the language should not. 0 votes 0 votes Please log in or register to add a comment.