0 0 votes Give a regular expression for LR, where L is the language given below, L = (a + b) b (a + ab)* My answer : ( a + ba )* b ( a + b ). Please verify ... Theory of Computation theory-of-computation finite-automata regular-expression + – Vicky rix 823 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Angkit commented Apr 3, 2017 reply Follow flag I think it's correct. 0 0 replyShare srestha commented Apr 3, 2017 reply Follow flag No your answer is not correct. See the given expression can end with aa but your RE cannot end with aa 0 0 replyShare Please log in or register to add a comment.
Best answer 4 4 votes your answer is correct just make fa and make initial state to final and final to initial and change the directions of arrow Optimus Prime answered Apr 3, 2017 • selected Apr 4, 2017 by Vicky rix Optimus Prime comment Share Follow 0 reply Please log in or register to add a comment.
