Register

identifying a regular language

250 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
M_Umair_Khan42900 asked Dec 29, 2022
787 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
User Avatar
1 votes
1 votes
1 answer
3
sachin_27 asked Jun 1, 2022
1,316 views
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b} if yes then why please explain
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}if yes then why please explain
User Avatar
0 votes
0 votes
2 answers
4
iarnav asked Dec 22, 2018
644 views
#TOC Regular Language Is this a regular set?
WXW^R where W,X belongs to (0,1)* W^R is reverse of a string!
WXW^R where W,X belongs to (0,1)*W^R is reverse of a string!
User Avatar
Link Copied!