1. Let S be the set of binary strings of length at least 5, i.e. Ss...

 

Transcribed Image Text:

1. Let S be the set of binary strings of length at least 5, i.e. Ss = {{0,1}|x|5}. (a) Build a recogniser for S, which is not a decider for S5. (b) Build an enumerator for S5. (c) Is S5 decidable? (d) If you had the option to have access to either a decider or a recogniser when solving membership of a set, which would you choose and why? 1. Let S be the set of binary strings of length at least 5, i.e. Ss = {{0,1}|x|5}. (a) Build a recogniser for S, which is not a decider for S5. (b) Build an enumerator for S5. (c) Is S5 decidable? (d) If you had the option to have access to either a decider or a recogniser when solving membership of a set, which would you choose and why?