COS3701 is a continuation of COS2601 . Cos2601 introduced students to language theory based on set theory introduced in cos1501 and discussed finite automatons as simple computers that accept regular languages (defined by regular expressions( chapters 1 to 11 Cohen) Cos1501 makes progress on language theory introduced in cos2601 , computers are seen as language processors ( binary to human readle output) we are introduced to the pushdown automaton which works on a stack and accepts context free grammar( CFG=Regular language) We then continue building up our mathematical definition of a computer as a function that processes an input and returns an output with the Turing Machine( the model which your laptop is based on) We end with the Church Thesis
Quality you can trust: written by students who passed their exams and reviewed by others who've used these notes.
No worries! You can immediately select a different document that better matches what you need.
No subscription, no commitments. Pay the way you're used to via credit card or EFT and download your PDF document instantly.
“Bought, downloaded, and aced it. It really can be that simple.”
