1 votes 1 votes { wxw | w belongs to {0,1}* , x belongs to {0,1}+ } Theory of Computation theory-of-computation regular-language identify-class-language + – Isha Karn asked Oct 25, 2014 • retagged Jul 4, 2017 by Arjun Isha Karn 1.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 7 votes 7 votes Lets see the strings in L = { 0, 1, 00, 01, 10, 11, 000, ..... } (When w is ϵ, wxw generates all these strings and hence we don't need to consider any other case for w) = Σ* - {ϵ} Hence, regular. More examples: http://gatecse.in/wiki/Identify_the_class_of_the_language Arjun answered Oct 25, 2014 • selected Oct 25, 2014 by Arjun Arjun comment Share Follow See all 2 Comments See all 2 2 Comments reply Bhagirathi commented Nov 3, 2014 reply Follow Share Can you explain in terms of a dfa.how will you simulate it? 0 votes 0 votes erh commented Aug 5, 2016 reply Follow Share DFA for this will be same as the dfa for accepting string with length at least 1, ie two states dfa 0 votes 0 votes Please log in or register to add a comment.
