recategorized by
899 views
1 votes
1 votes

Assume, $L$ is regular language. Let statements $S_1$ and $S_2$ be defined as:

$S_1 : SQRT(L) = \{ x \mid \text{ for some y with } \mid y \mid = \mid x^2 \mid , xy \in L \}$ is regular.

$S_2 : LOG(L) = \{ x \mid \text{ for some y with } \mid y \mid = 2^{\mid x \mid }, xy \in L\}$ is regular.

Which of the following is true?

  1. $S_1$ is correct and $S_2$ is not correct
  2. Both $S_1$ and $S_2$ are correct
  3. Both $S_1$ and $S_2$ are not correct
  4. $S_1$ is not correct and $S_2$ is correct
recategorized by

1 Answer

0 votes
0 votes
Answer C) both are not correct

S1: Say x=3 , then y=9 ,xy∊27 which may not in L , but L always contain a multiple of x

S2:Say x=3 , then y=8 , xy∊24 which may not be in L
Answer:

Related questions

1 votes
1 votes
0 answers
1
go_editor asked Jul 22, 2016
995 views
Non-deterministic pushdown automaton that accepts the language generated by the grammar: $S \rightarrow aSS \mid ab$ is$\delta (q_0, \lambda , z)= \{ (q_1, z) \}; \delta...
1 votes
1 votes
1 answer
3
go_editor asked Jul 22, 2016
2,778 views
The language $L=\{a^n b^n a^m b^m \mid n \geq 0, m \geq 0 \}$ isContext free but not linearContext free and linearNot context free and not linearNot context free but line...