143 views

1 Answer

1 votes
1 votes
Generally brute force, or understanding what the language is.

In the question, as far as I can understand, the language $a^{2m + 1}b^{2n + 1}$ is Odd number of $a’s$ followed by some odd number of $b’s$ and those odd numbers will be greater than $1$ as $m$ and $n$ cannot be 0.

Since, the length 10 is asked, what odd numbers we can take?

$\{3, 5, 7, 9\}$

And how can we make $10$ from selecting $2$ numbers independently ? (because $m$ and $n$ have no relation with each other)

$a^7b^3, a^5b^5, a^3b^7$

These $3$ strings can be made.

Related questions

456
views
0 answers
0 votes
shashank joshi asked Nov 18, 2018
456 views
Q- the Grammer S-> aSb | bSa |SS |Ɛa) unambiguous CFGb) ambiguous CFGc) not a CFGd) deterministic CFG
526
views
0 answers
0 votes
Nishi Agarwal asked Mar 10, 2019
526 views
A(n){if(n<1) return (1);else return A(n-2)+B(n-1);}B(n){if(n<=1) return 1;else return B(n-1)+A(n-2);}