1 votes 1 votes Build an DFA that accepts a and b as an input and contain words that does not begin and end with double letters. Theory of Computation theory-of-computation finite-automata + – hashir inayat asked Jul 20, 2017 hashir inayat 790 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Shubhanshu commented Jul 21, 2017 reply Follow Share it will not accept abbbbba which is nor starting with aa or bb and neither ending with aa or bb. 0 votes 0 votes joshi_nitish commented Jul 21, 2017 reply Follow Share ohh sorry, i was in hurry, i hadnt checked it, now corrected.... 0 votes 0 votes Shubhanshu commented Jul 21, 2017 reply Follow Share It seems correct now.!! 0 votes 0 votes Please log in or register to add a comment.