COW :: Courseware :: Courses :: ceng280 - 20182
METU Ceng On the Web
| print-view
: Formal Languages And Abstract Machines
description: Introduction to strings, languages, and grammars. Concept of abstract machines and language acceptance. Deterministic and nondeterministic finite state machines. Regular expressions. Machines with pushdown tape. Turing machines and recursive functions.
objective: Computer Science & Engineering needs a mathematical language to abstract away from particulars of computing machinery and to concentrate on systematicity, capacity, and efficiency of computing in the abstract. Theory of Formal Languages is one such language (Complexity Theory is another). The theory has found scientific and practical use in CS theory, programming languages, compilers, concurrent processes, AI, etc. In fact, description of any computational process can be recast in formal language theory. From this perspective, the theory can be seen as a vehicle for communicating the ideas clearly and precisely among computer scientists. This course is an introduction to the topic.
type: must
oibs-code: 5710280
  • Aysenur BIRTURK
    OfficeHours: Tuesday 14:40-15:30 (20181)
    room: A303
    tel: 5578
  • Mazlum Ferhat Arslan
    room: A410
    tel: 5541
  • Muhammet Tugberk Isyapar
    room: A302
    tel: 5538
There may be some hidden items below this line (such as lectureNotes available to only course-students. You need to login first to see all available items.
    Lecture NotesExams
    • final : 2019-05-26 09:30:00, rooms: bmb1, bmb2, bmb3, bmb4, bmb5
    • evaluation : 2019-05-02 10:40:00, rooms: bmb2
    • midterm : 2019-04-30 18:00:00, rooms: bmb1, bmb2, bmb3, mm125
    • evaluation : 2019-04-29 15:40:00, rooms: bmb1
    • midterm : 2019-03-25 18:00:00, rooms: bmb1, bmb2, bmb3, bmb4, MM14
    [[+hid]] hw_title deadline graded selectit
    The list is empty....
      | top
      2019-06-20 22:06:47, 1561057607.756 secs
      COW by: Ahmet Sacan