COS2601 Theoretical Computer Science II
University of South Africa
Hier vind je de beste samenvattingen om te slagen voor COS2601 Theoretical Computer Science II. Er zijn o.a. samenvattingen, aantekeningen en oefenvragen beschikbaar.
Alle 3 resultaten
Sorteer op:
-
Tentamen (uitwerkingen)
COS2601 Theoretical Computer Science II Example examination paper and solutions
-
---11november 20212021/2022A+
- 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...
-
$3.99 Meer Info
DoctorReinhad
-
Tentamen (uitwerkingen)
COS2601 Examination Paper And Solutions.
-
---11november 20212021/2022A+
- 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 ...
-
$4.19 Meer Info
ExcelAcademia2026