1 votes 1 votes if L1 ={a^n | n>=0} then L1^R is? A_i_$_h asked Aug 23, 2017 A_i_$_h 255 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Prashant. commented Aug 23, 2017 reply Follow Share See language is regular and we know reversal of regular language is regular. So L^R is also regular. Actual language is L1^R ={a^n | n>=0} 0 votes 0 votes joshi_nitish commented Aug 23, 2017 reply Follow Share L1R = L1. 0 votes 0 votes amrendra pal commented Aug 23, 2017 reply Follow Share Regular languages are closed under reversal operation so L1R will be regular. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L1 = a^n = L1^r Both are same language and regular Surya Dhanraj answered Aug 24, 2017 Surya Dhanraj comment Share Follow See all 0 reply Please log in or register to add a comment.