386 views

2 Answers

Best answer
1 votes
1 votes

a) infinite such no are there to satisty above inequality 
b) in this option also we have one comparison we need stack so CFL but not regular 
c) same as above option we need stack for comparison 
d) this option is regular becaus we have no dependency between m,n,k so it is regular as we can write the regular expression as (a+b)+a+

selected by
0 votes
0 votes
option c is regular language

because n is finite

here total 4020 state is required to construct the dfa

 

just replace 2009 by 3 and then

construct the dfa  it will be easy to understand

Related questions

0 votes
0 votes
2 answers
1
anupamsworld asked Aug 29, 2022
560 views
Which of the following is/are Regular?A] $\left \{ XWYW^{R} \space\ | \space\ W,X,Y \in \left \{ a,b \right \}^{+} \right \}$B] $\left \{ WXW^{R}Y \space\ | \space\ W,X,Y...
0 votes
0 votes
1 answer
2
Mayankprakash asked Jan 24, 2019
296 views
Please suggest me in briefly for revision .How to we test regular,dcfl,cfl,recursive and recursive enumeranle.Eg say if we can find the pattern it's regular.Please help...
0 votes
0 votes
0 answers
4