Recursive Set

Need a Solution to the following question




Let $\Sigma$ be the alphabet defined as follows: $\Sigma = {e, l, v}$. We now deifine the set of strings P according to the following:

BASIS STEP: If $x \in \Sigma $ then $x \Sigma P$.

RECURSIVE STEP: If $\omega \in P$ and $x \in \Sigma $, then $x \omega x \in P$.

Show that the string level is in P

Set Theory Functions Discrete Mathematics
Jack Smith Jack Smith
13
Matchmaticians Recursive Set File #1 File #1 (PNG)
Report
  • Jack Smith Jack Smith
    0

    Thanks for replying Please provide full answers, and please solve them in a way that a someone who semi-understands (me) can comprehend and study it in the future.

Answer

Answers can only be viewed under the following conditions:
  1. The questioner was satisfied with and accepted the answer, or
  2. The answer was evaluated as being 100% correct by the judge.
View the answer
Dynkin Dynkin
779
  • Jack Smith Jack Smith
    0

    Will greatly appreciate if you could please provide step by step full answer, and please solve it in a way that someone who semi-understands (me) can comprehend and study it in the future.

  • Dynkin Dynkin
    0

    There is nothing more to say, the answer is as full as it can get.

The answer is accepted.
Join Matchmaticians Affiliate Marketing Program to earn up to a 50% commission on every question that your affiliated users ask or answer.