search
Log In
0 votes
162 views

which of the statement is/are correct

in Theory of Computation 162 views
0

If L={a+b+} then LR={b+a+}

So L contains strings {ab,aab,aaab,abbb...} and LR={ba,baa,bba,...}

No strings common.

If L={a+} then LR={a+}

So L contains strings {a,aa,aaa...} and LR contains {a,aa,aaa...}

All strings common.

So S1 is false.

If L1={a} and L2={a*}

Then L1L2={aa*} and L2L1={a*a}  Both are same hence commutative in this case also..

S2 is false..

 

0

@MiNiPanda

post it as answer

0
Okay done :)

1 Answer

0 votes
 
Best answer

If L={a+b+} then LR={b+a+}

So L contains strings {ab,aab,aaab,abbb...} and LR={ba,baa,bba,...}

No strings common.

If L={a+} then LR={a+}

So L contains strings {a,aa,aaa...} and LR contains {a,aa,aaa...}

All strings common.

So S1 is false.

--------------------------------------------------------

If L1={a} and L2={a*}

Then L1L2={aa*} and L2L1={a*a}  Both are same hence commutative in this case also..

S2 is false..

 


selected by

Related questions

0 votes
1 answer
1
176 views
Min number of states in equivalent DFA ______________ will it be 4 or 5 ??
asked May 2, 2019 in Theory of Computation srestha 176 views
0 votes
1 answer
2
182 views
The number of distinct 1 letter subword present in “NAMITA” is equal to_______________ Answer given subwords are N,A,M,I,T But last ‘A’ is not a subword. Is it correct??
asked May 2, 2019 in Theory of Computation srestha 182 views
2 votes
1 answer
3
392 views
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length} $P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on which $M$ halts } The number of problem which is $RE$ but not $REC$ _____________
asked Apr 30, 2019 in Theory of Computation srestha 392 views
0 votes
0 answers
4
254 views
The pushdown automata $M=\left \{ \left ( q_{0},q_{1},q_{2} \right ),\left ( a,b \right ) ,\left ( 0,1 \right ),\partial ,q_{0},0,\left \{ q_{0} \right \}\right \}$ $\partial \left ( q_{0},a,0 \right )=\left ( q_{1},10 \right )$ ... think here $q_{2}$ is accepting state , not $q_{0}$ As last transition going from $q_{2}$ to $q_{0}$ and not $q_{0}$ to $q_{2}$ Am I right?
asked Apr 24, 2019 in Theory of Computation srestha 254 views
...