1,042 views
1 votes
1 votes

Please ANSWER these?

1 Answer

Best answer
4 votes
4 votes

A)$L_{1}=\left \{ a^{n}\,|\, n> 0 \right \} L_{2}=\left \{ b^{n}\,|\, n> 0 \right \}$

Regular language are closed under Concatenation.Hence regular 

$L_{1}.L_{2}=\left \{ a^{x}b^{y}\,\,|\,\,x,y > 0 \right \}$

Regular expression-:$a^{+}b^{+}$


B)$L_{2}=\left \{ a^{n}b^{m}\,\,|\,\,n,m \geq 0 \right \}$

Regular Expression-:$a^{*}b^{*}$

Hence regular


C) Not regular need a stack to remember $n$,Thus can't be solved by FSM

Hence not regular 

selected by

Related questions

0 votes
0 votes
1 answer
1
Deepak9000 asked Nov 27, 2023
201 views
Why is C is regular as it non regular as?Please help me with this confusion
0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
743 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
0 votes
0 votes
2 answers
4
iarnav asked Dec 22, 2018
624 views
WXW^R where W,X belongs to (0,1)*W^R is reverse of a string!