Register

#Test Series

1,818 views
0 0 votes
3. Consider these 2 statements:
S1: LR = L, if and only if L is the language of palindromes.
where LR is obtained by reversing all the strings of L.
S2: | L1∙ L2 | = | L1 | × | L2 |
Relation?
(a) Both are F (b) Both are T
(c) S1 → T, S2 → F (d) S1 → F, S2 → T

2 Answers

0 0 votes

For Statement 1:-

you know that w=wR ===>  it is a palindrome string.

let L= Collection of Strings  which are palindromes ===> LR = reversing each string in L = string in L

∴ S1 is TRUE.

 

For Statement 2 :-

| L1.L2 | = |L1| X | L2 |

LHS = concatenate L1 string, L2 String and take the length of resultant

RHS = Take the length of string in L1, length of string in L2 and multiply them 

Obvisiouly it is a relation....but not a function, 

• edited by
Voting & Accepting an answer helps improve the community
← Previous · self doubtNext → · SELF DOUBT
← Previous in category · Regular GrammarNext in category → · Language of strings ...
Position:
Show:

Related questions

0 0 votes
0 0 answers
444
444 views
himgta asked Aug 31, 2018
444 views
#Test series
https://gateoverflow.in/21039/simplified-cfgDoubt in the solution....plz help!
0 0 votes
1 1 answer
1.1k
1.1k views
himgta asked Aug 7, 2018
1,065 views
#Test series
0 0 votes
0 0 answers
745
745 views
himgta asked Jul 31, 2018
745 views
#Test series
https://gateoverflow.in/188609/me-test-seriesThis question has not been answered, can somebody solve it!
1 1 vote
2 2 answers
2.5k
2.5k views
himgta asked Jul 31, 2018
2,526 views
#Test series
Consider the following CFG.S → aSa | bSb | a | b | εFor the above CFG, the total number of strings generated whose length is less than or equal to 8 [exclude the empty st...