0 votes 0 votes L={xww |x,w$\epsilon${a,b}star} tell which machine amit166 asked Oct 4, 2018 amit166 175 views answer comment Share Follow See 1 comment See all 1 1 comment reply Shubhanshu commented Oct 4, 2018 reply Follow Share Above language is regular. Trick : keep w as epsilon and use x for whatever string u want to generate. Note : it is a complete language over a, b Machine DFA. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes L is regular. Since, w can be ϵ and x∈(a+b)∗ , making L=Σ∗ . i.e.; the set of strings generated by L is {ϵ,a,b,aa,ab,ba,bb,aaa,…}=Σ∗ Manas Mishra answered Oct 5, 2018 Manas Mishra comment Share Follow See all 0 reply Please log in or register to add a comment.
