COMP 3130

Formal Languages, Automata and Computability

Lec 01, Lec 01 and Sem S01 selected

Students discuss formal grammars, normal forms, the relationship between grammars and automata, regular expressions, finite state machines, pushdown automata, and Turing machine computability. Additional topics include the Halting Problem; an introduction to recursive function theory; application to programming languages; and editors and command languages (operating systems).

Sections

Lecture, pick one

Lec 01

Wed 10:30-11:20

Wed10:30-11:20Old Main Building 133020457

Lec 01

Mon 10:30-12:20

Mon10:30-12:20Old Main Building 133020457

Seminar

Sem S01

Wed 11:30-12:20

Wed11:30-12:20Old Main Building 133020458

Syllabus

Have the syllabus for COMP 3130? Share it and everyone gets the grading, textbooks and rules.