Recursive definition of Language of Strings Over {0, 1} Ending in 0

Language of Strings Over {0, 1} Ending in 0

• Base Case: The string 0 is in the language $L$.
• Recursive Step:
  • If $x$ is in $L$, then $0x$ and $1x$ are in $L$.
• Closure: A string is in $L$ if and only if it can be derived from the base case using a finite number of applications of the recursive step.