344 views

1 Answer

Best answer
1 votes
1 votes

The language can be further described systematically as :

(n-k) is odd fine..This means that either n or k will be odd since if both are even or odd then difference will be even..

Similar is the case for (m - l)..Hence we can redefine the language as :

L = { ai bj ck dl  | if(i is odd and l is even then  j is odd and k is even or vice versa }  U

     {  ai bj ck dl  | if(i is even and l is odd then  j is odd and k is even or vice versa }

Now each of the parts described can be done by finite automata and hence regular..

So L which is union of these parts is also regular [Also follows from the fact that union of regular langauges is regular]

So L is regular ..

Hence A) is the correct answer..

selected by

Related questions

1 votes
1 votes
1 answer
2
PEKKA asked Dec 5, 2016
326 views
The Java language is:A context free languageA context sensitive languageA regular languageParsable fully only by a Turing machine
3 votes
3 votes
1 answer
3
PEKKA asked Jan 2, 2017
582 views
f(n) = $\Theta (n^{2})$ g(n) = $\Omega (n)$ h(n)=O(log n) then [ f(n) . g(n) ] + [h(n) . f(n) ] is $\Omega (n)$$\Theta (n^{2})$O(log n)None
0 votes
0 votes
2 answers
4
PEKKA asked Dec 6, 2016
466 views
Complexity of the following snippet is for (i=1;i<n;++i) for(j=1;j<=n;j=j+i) c=c+1;