1 votes 1 votes Theory of Computation regular-expression theory-of-computation finite-automata + – shekhar chauhan asked Apr 21, 2016 shekhar chauhan 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes First state and last state in your DFA are equivalents. it will be look like : DFA over {a,b} that accepts all strings that doesn't contain "aa" as substring. Praveen Saini answered Apr 21, 2016 selected Apr 21, 2016 by Arjun Praveen Saini comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments vamsi2376 commented Apr 22, 2016 reply Follow Share Can we say that the above FA represents the set of all strings which does not contain "a" as second symbol from left.????? 0 votes 0 votes Praveen Saini commented Apr 22, 2016 reply Follow Share No, as it will also reject the stings as abaaba. we will reach to rejecting (dead) state as soon as we get a followed by a. 2 votes 2 votes vamsi2376 commented Apr 23, 2016 reply Follow Share Thank You :) 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes Apply state elimination methods: Regular expression will be like below b*a(bb*a)* Paras Nath answered Dec 26, 2016 Paras Nath comment Share Follow See all 0 reply Please log in or register to add a comment.