Consider a set of ? strings over alphabet ? = {?, ?}, defined recursively as follows. ?∈?
? ∈ ? ⟹ ??? ∈ ?
Furthermore, ? has no elements other than those obtained by
finitely many applications of the
recurrence rule given in its definition. For example, the first
four elements of ? are
?, ???, ?????, ???????
Use mathematical induction to prove that there are no strings in ?
that end in ?. {3 points.
Get Answers For Free
Most questions answered within 1 hours.