2 votes 2 votes Give a regular expression for $L^{R}$ L = $(a+bc)^{*}(c+\phi)$ Theory of Computation theory-of-computation regular-language peter-linz peter-linz-edition4 regular-expression + – Mk Utkarsh asked Mar 14, 2018 • edited Mar 4, 2019 by Naveen Kumar 3 Mk Utkarsh 376 views answer comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Mar 14, 2018 reply Follow Share it wil be, $c(a+cb)^*$ 1 votes 1 votes Please log in or register to add a comment.
Best answer 3 votes 3 votes Reversal of finite automata can be constructed by interchanging final and initial state and by reversing the transition direction from the finite automata abhishekmehta4u answered Mar 14, 2018 • edited Mar 14, 2018 by abhishekmehta4u abhishekmehta4u comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Mar 14, 2018 reply Follow Share it should be $c(a+cb)^*$ 1 votes 1 votes Please log in or register to add a comment.