3 votes 3 votes I got 3 states... Given is 4 Theory of Computation theory-of-computation regular-language context-free-language + – Ashwin Kulkarni asked Jan 16, 2018 Ashwin Kulkarni 529 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply MiNiPanda commented Jan 16, 2018 reply Follow Share I also got 3 states only..is the language aa(aaa)^* ? 1 votes 1 votes asriv commented Jan 16, 2018 reply Follow Share same here 0 votes 0 votes Gurdeep Saini commented Oct 22, 2018 reply Follow Share finally we got S->aa/Saaa means L=aa+aaa(aa)+ please correct me if i am wrong 0 votes 0 votes Deepanshu commented Oct 22, 2018 reply Follow Share Gurdeep Saini L=aa+aaa(aa)+ by this language ( 7 times a) also accepted according to u but i am not able to find any string of 7 length 0 votes 0 votes Gurdeep Saini commented Oct 23, 2018 reply Follow Share thanks @deepanshu now check again L=(aaa)*(aa) 0 votes 0 votes Deepanshu commented Oct 23, 2018 reply Follow Share Gurdeep Saini hmm now i think we can accept sequences 2,5,8,11 so from my view it is correct : ) 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes This language can be further modified as S-Saaa|a Which will generate language a(aaa)*. For which at least 4 states are required to draw the DFA. pandit_shubhanshu answered Jan 17, 2018 • reshown Jan 17, 2018 by pandit_shubhanshu pandit_shubhanshu comment Share Follow See 1 comment See all 1 1 comment reply Ashwin Kulkarni commented Jan 17, 2018 reply Follow Share What about string "aa" or "aaaaa" 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes S -> Xa|Ya S -> Zaa|Wa S -> Saaa|Saa|E as there is a possibility of coming aaa as the substring of the given language. So it will contain 4 states to achieve it. Nihal Singh answered Jan 17, 2018 Nihal Singh comment Share Follow See all 0 reply Please log in or register to add a comment.