CSC236H5 Lecture Notes - Lecture 1: Empty String, Subset, Empty Set

15 views2 pages
School
Course
Professor

Document Summary

Consider strings made up only of the characters 0 and 1; these are binary strings. A binary palindrome is a palindrome that is also a binary string. Let f (n) be the number of binary palindromes of length 2n, for n 0. The only length-0 string is the empty string, and that is a palindrome. So, we have 1 = 20 palindrome of length 0, as required. We want to prove this for n + 1, which is length 2n + 2. A string of length 2n + 2 has a 0 at the beginning and end, or a 1 at the beginning and end, with 2n symbols in between. The predicate here is p (n) : f (n) = 2n. We must prove that n 0, p (n). When n = 0, the length of our binary strings is 2n = 2 0 = 0, so we must show that there are 20 = 1 palindromes of length 0.

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers
Class+
$30 USD/m
Billed monthly
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
7 Verified Answers

Related Documents

Related Questions