1 votes 1 votes Regular expression for all strings starts with ab and ends with bba is. a) aba*b*bba b) ab(ab)*bba c) ab(a+b)*bba d) All of the mentioned Doubt: starting with 'ab' and ending with 'bba', so 'abba' should also be accepted right? Theory of Computation regular-expression theory-of-computation finite-automata + – Purple asked Jan 28, 2016 Purple 14.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 7 votes 7 votes right answer is : ab(a+b)*bba + abba Digvijay Pandey answered Jan 28, 2016 selected Apr 22, 2016 by Pooja Palod Digvijay Pandey comment Share Follow See all 3 Comments See all 3 3 Comments reply Shubhanshu commented Jul 3, 2017 reply Follow Share How will DFA look like? 0 votes 0 votes kask commented Aug 7, 2018 reply Follow Share How fa look like 0 votes 0 votes kela commented Apr 2, 2021 reply Follow Share DFA https://gateoverflow.in/?qa=blob&qa_blobid=3413313714973613425 0 votes 0 votes Please log in or register to add a comment.