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
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 be viewed only if
  1. The questioner was satisfied and accepted the answer, or
  2. The answer was disputed, but the judge evaluated it as 100% correct.
View the answer
Dynkin Dynkin
  • 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 50% commission on every question your affiliated users ask or answer.