Smallest counterexample Study guides, Class notes & Summaries

COS2601 Examination Paper And Solutions. Theoretical Computer Science II. A recursive definition for the language ODDAB should be compiled. Consider the alphabet ∑ = {a, b} and the language ODDAB, where ODDAB consists of all words of odd length that contain the substring ab. Provide (i) an appropriate universal set, (1) (ii) the generator(s) of ODDAB, (2) (iii) an appropriate function on the universal set, and then (1) (iv) use these concepts to write down a recursive definition for the ...

guess and check strategy calls for students to make an initial guess at the solution, check the answer, and use that outcome to guide the next guess working backward strategy requires students to determine a starting point when solving a problem where the final result and the steps to reach the result are given 00:03 01:39 estimating and testing for reasonableness related skills that students should employ before and after solving a problem; students compare their esti...

These notes are for students looking to get a summary on all things functions and proofs with base cases.

COS2601 Theoretical Computer Science II Example examination paper and solutions (a) Let S = {a bb bab abaab}. For each of the following strings, state whether or not it is a word in S*: (i) abbabaabab (ii) abaabbabbbaabb (2) (b) Give an example of a set S such that S* only contains all possible strings of combinations of a’s and b’s that have length divisible by three. (4) (c) Give an example of two sets S and T of strings such that S* = T* but S ⊄ T and T ⊄ S. (4) ANSWER TO QU...