1,275 views
1 votes
1 votes

 How L2 is NOT regular and L3 is regular??? 

please explain

2 Answers

Best answer
1 votes
1 votes
#a - #b <=10 there can be infinite number of solutions for this.. Hence not regular bcz finite representation is not possible we can't put something in loop to produce this language...

wcwwR since c belongs to (a, b) * we can expand c in such a way that language looks like starting nd ending with same symbol therefore it is regular language.
selected by
0 votes
0 votes

#a - #b are less than or equal to 10. that means the difference between a and b must be less than 10 and there infinite number of such finite string possible . So, this is regular

wcwwr is regular when $w=\epsilon$ andc=(a+b)*

as in this case we got all string like $\left \{ \epsilon ,a,b,aa,bb,ab,abb........ \right \}$

Related questions

0 votes
0 votes
1 answer
1
Abhishek3301 asked Feb 6
9 views
Number of states in a minimal deterministic finite automata that accepts the language L = {(a + b) a* b*} What should be the answer to this question?
0 votes
0 votes
1 answer
3
0 votes
0 votes
2 answers
4
jugnu1337 asked Sep 3, 2023
344 views
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to