0 votes 0 votes Construct a DFA over Σ=(a,b) so that it accepts all strings where 1) 2nd symbol from the right is 'a' 2) 3rd symbol from the right is 'a' Theory of Computation theory-of-computation finite-automata finite-automata + – Sambhrant Maurya asked Sep 27, 2018 Sambhrant Maurya 4.6k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments hitendra singh commented Sep 29, 2018 reply Follow Share ......... correct me if I am wwrong? 0 votes 0 votes Shiva Sagar Rao commented Jan 30, 2021 i edited by Shiva Sagar Rao Jan 30, 2021 reply Follow Share 3rd symbol from the right is 'a': https://gateoverflow.in/544/gate1991-17-b 2nd symbol from the right is 'a': https://gateoverflow.in/63063/dfa 0 votes 0 votes Shaik Masthan commented Jan 30, 2021 reply Follow Share https://gateoverflow.in/blog/8795/minimal-deterministic-finite-automata 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes first draw the rough nfa and then directly convert it into the DFA using state transition method, Right hand side page contains the required dfa... pradeepchaudhary answered Sep 29, 2018 pradeepchaudhary comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Please check the above DFA. Correct me if wrong. Dharmesh Dubey answered Jan 13, 2021 Dharmesh Dubey comment Share Follow See 1 comment See all 1 1 comment reply ankit6271 commented Jan 10, 2022 reply Follow Share Wrong as it is accepting abaa ,abab,abba,abbb also which is wrong 0 votes 0 votes Please log in or register to add a comment.
