367 views
0 votes
0 votes

Which of the following languages are regular

1)L= wwR v    : v,w belongs to  {a,b}+

2)L=uwwR v    :  u,v,w belongs to  {a,b}+  

3)L=uwwR v    :  u,v,w belongs to  {a,b}+  .|u| >= |v|

2 Answers

0 votes
0 votes
6 as minum no it can be [uv]>=n

where n=length of string.

here u=2

v=3

so minimum is 6
0 votes
0 votes
2 is regular language.

3 can't be regular language as we hv to calculate length of u and then compare with length of v, it is not possible as FA does not have memory unlike PDA.

1 is also not regular as it involved comparison in w.

Related questions

1 votes
1 votes
2 answers
1
ANJALI SAWARKAR asked Jul 27, 2017
953 views
L= {w: na(w) mod 3 >nb(w)mod 3}. how we will make dfa of this?
1 votes
1 votes
1 answer
2
Sanjay Sharma asked Apr 25, 2017
331 views
0 votes
0 votes
1 answer
3
Sanjay Sharma asked Apr 3, 2017
339 views
draw the DFA Show that the language L= {an: n is either a multiple of three or a multiple of 5} is regular.
0 votes
0 votes
0 answers
4
Sanjay Sharma asked Apr 15, 2017
337 views