Question: Need help in proving countability. What bijection here can show countability? Let ={x,y,z} be an alphabet and let S be the set of all finite
Need help in proving countability. What bijection here can show countability?
Let ={x,y,z} be an alphabet and let S be the set of all finite length strings over . Show that S is countable.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
