UNISA COS 201 Theoretical CS
Below is the outline of the outcomes of the subject. After reviewing the past exam papers it seems like each chapter is well represented in the exam and so it would be best to have an understanding of all the outcomes. Chapter 2 – Languages What an alphabet, a word, a language and the empty string are; what is meant by the length of a string; how to concatenate strings; what the closure of a set is, and how to form it; what Cohen means when he speaks of ‘proof by constructive algorithm’; Chapter ......
Chapters Covered in Prescribed Book The following are the chapter headings for the subject, which should give you an idea of what is covered in this subject… Chap 2 – Languages Chap 3 – Recursive Definitions Chap 4 – Regular Expressions Chap 5 – Finite Automata Chap 6 – Transition Graphs Chap 7 – Kleene’s Theorem Chap 8 – Finite Automata with Output Chap 9 – Regular Expressions Chap 10 – Nonregular Languages Important Sections outlined by the Examiner The following was taken from the notes of the ......
So I am slogging away at my UNISA stuff. I have just finished doing the initial once non stop read through the first 11 chapters of my COS 201 Textbook - “Introduction to Computer Theory 2nd Edition” by Daniel Cohen. It has been an interesting couple of days, with familiar concepts coming up as well as some new territory. In this posting I am going to cover the first couple of chapters of the book. Let start with Formal Languages… What exactly is a formal language? Pretty much a no duh question for ......