0 votes 0 votes Which of the following languages is/are REGULAR ? A) L1 = { wxwR / w,x $\in$ {a,b}* and length(w) = 6 } B) L2 = { wxwR / w,x $\in$ {a,b}* and length(x) = 6 } I feel A) is regular ..but B) is not ...Please verify ... Theory of Computation theory-of-computation + – Vicky rix asked Apr 17, 2017 retagged Jun 4, 2017 by Arjun Vicky rix 479 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Prashant. commented Apr 17, 2017 reply Follow Share A is regular since limited comparison only till length 6. 0 votes 0 votes Arunav Khare commented Apr 17, 2017 reply Follow Share A is regular as it is bounded, which means is finite in terms of length of w. So matching possible B is not regular as length of w is not bounded, which means is infinite, so matching not possible 3 votes 3 votes student2018 commented Apr 17, 2017 reply Follow Share ya ok understood and thank u 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes if in second question there is no boundation on length of length of (x) then it would be regular na plz rectify Kaluti answered Jun 4, 2017 Kaluti comment Share Follow See all 0 reply Please log in or register to add a comment.