Register

Regular language or Not

3,103 views
3 3 votes
I have a set of languages. which is needed to be categorized as regular or not regular languages...Here i have mentioned some of them please help me to understand which are regular and which are not regular with the proper explanation...

1:  {ww/ w ∈ {a, b }* }
2:  {ww/ w ∈ {a, b }+ }
3:  {wxwy/ w,x,y ∈ {a, b }+ }
4:  {xww^R/ w ∈ {a, b }+ , x∈{a, b }* ,w^R is reverse of w }
5: {xww^R/ x ∈ {a, b }+ , w∈{a, b }* ,w^R is reverse of w }
6: {ww^Rx/ w,x ∈{a, b }*,w^R is reverse of w }    
7: {ww^Rx/ w,x ∈ {a, b}+  ,w^R is reverse of w }
8: {ww^R/ w∈ {a, b}+  ,w^R is reverse of w }
9: {ww^R/ w∈ {a, b}*  ,w^R is reverse of w }

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · turning machineNext → · decidability 
← Previous in category · turning machineNext in category → · decidability 
Position:
Show:

Related questions

0 0 votes
0 0 answers
258
258 views
Monti Tekankar asked Aug 19, 2025
258 views
which language is regular or which is not regular
i am unable to recognize the which language is regular or which is not regular
1 1 vote
1 1 answer
3.2k
3.2k views
M_Umair_Khan42900 asked Dec 29, 2022
3,236 views
Write regular expression to denote a language L a) String which begin or end with either 00 or 11. b) The set of all strings, when viewed as binary representation of integers, that are divisible by 2. c) The set of all strings containing 00. d) String not containing the substring 110.
Write regular expression to denote a language La) String which begin or end with either 00 or 11.b) The set of all strings, when viewed as binary representation of intege...
1 1 vote
1 1 answer
2.5k
2.5k views
sachin_27 asked Jun 1, 2022
2,494 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
0 0 votes
2 2 answers
1.5k
1.5k views
rohan.1737 asked Aug 17, 2018
1,477 views
Self Doubt in checking whether a language is regular or not
Is there any way to check whether a language is regular or not without using Pumping lemma?