• retagged by
1,200 views

1 Answer

Best answer
5 5 votes
There are $2$ cases:

1. $n$ and $m$, both are even $\rightarrow (aa)$*$(bb)$*

2.  $n$ and $m$, both are odd $\rightarrow a(aa)$*$b(bb)$*

Regular expression: $\rightarrow (aa)$*$(bb)$* $+$ $a(aa)$*$b(bb)$*

Regular grammer:

$S \rightarrow aaA/aA_{1}/\epsilon$

$A \rightarrow aaA/bbB/\epsilon$

$B \rightarrow bbB/\epsilon$

$A_{1} \rightarrow aaA/bB$
• edited by
Position:
Show:

Related questions

1 1 vote
0 0 answers
1.4k
1.4k views
gauravkc asked Dec 29, 2017
1,353 views
0 0 votes
2 2 answers
2.7k
2.7k views
sanju77767 asked Apr 2, 2018
2,713 views
29791305_10156267704977640_8232384361710835589_n.jpg960x579 25.7 KBplzzz check this A and D are already eliminatedOption B and C are equivalent or not…Any string which I’...
3 3 votes
0 0 answers
1.6k
1.6k views
Arnab Bhadra asked Nov 22, 2017
1,602 views
L = {w | no of 0's in w != no of 1's in w and w Ɛ(0+1)*}What is the Language L?a. Regularb. CFLC. CSL