5.1.1. Generalization to larger alphabet

Try these first

1. 1.

   What does countable mean in the context of sets?

   Hint

   Consider how numerical sequences relate to set elements.

2. 2.

   What is Π* in relation to an alphabet?

   Hint

   Think about different combinations of the alphabet symbols at different lengths.

3. 3.

   What does a countable set imply?

   • It can be finite
   • It can be infinite
   • Both

   Hint

   Remember examples of finite and infinite sequential numbers.

4. 4.

   Is Π* finite or infinite?

   • True
   • False

   Hint

   Consider how strings can keep expanding with larger subsets.

5. 5.

   Given an alphabet of size 5, find the number of unique strings of size 4.

   Hint

   Use exponent rules with m as the number of symbols and n as the string length.

6. 6.

   If we assume a programming language allows infinite valid instructions between begin and end, create a contradiction based on the theory discussed.

   Hint

   Consider how instructions relate to valid program structure.