Formal Languages and Logic, Fall 2018 (CO21-320352)

Jacobs University Bremen, Fall 2018, Herbert Jaeger

Class sessions: Tuesdays 9:45-11:00 (Lecture Hall Res. 1), Thursdays 11:15-12:30 (West Hall 8)

Office hours:No regular office hours. If I'm in my office and you want to see me, knock and enter and I will have time. If you want to make sure that I am in, drop me an email for fixing an appointment.

Topics: Formal languages, discrete automata, first-order logic. This course gives an introduction to the most basic themes of theoretical computer science. Formal languages and discrete automata are the fundaments of programming languages and their parsing and compiling. First-order logic is the basis of artificial intelligence, program verification and advanced data base systems.

Lecture notes: self-contained, complete set of lecture notes

Further helpful documents:

Additional reading: a condensed intro to RDF, written by Jan Wilken Dörrie. To be enjoyed at the end of the lecture as this concerns a marriage between logic and grammars, of central importance for "semantic web" techologies.

Course culture. The online lecture notes are a fully self-contained, textbook-style, detailed text. All exam questions are based solely on what is in the lecture notes. Thus, a student could perfectly pass this course by just home-studying the lecture notes, tuning his/her skills on the weekly homeworks, sit in the exams, and be done without ever seeing me. Ooops. I do want to see my students... Easy: I make classroom attendance mandatory. Ooops again - mandatory boredom? Solution: (i) mandatory classroom presence, (ii) mandatory pre-reading of the lecture note portion of the day, (iii) in class I will only briefly rehearse the pre-read lecture note material, making sure that everybody has a good grasp of it, and then (iv) I will spend most of the classroom time telling you stuff that is related to the lecture note material, but outside of it -- stuff you will not find in typical lecture notes: historical background, applications, connections of computer science to other sciences, tricky problems and open questions, math minitutorials, and more. This "extra" stuff will, I hope, make attendance worth its while, although it is not exam-relevant. You will, I hope very much, be amazed how deeply the technical material of this lecture is connected to realities outside (and underneath) CS.

Grading and exams: Grading and exams: The final course grade will be composed from homeworks (15%), presence sheets (10%), and quizzes/exams. There will be four miniquizzes (written in class, 20 minutes), the best three of which will each account to 15% of the final grade (worst will be dropped), and one final exam, counting 30%. All quizzes and the final exam are open book. Each quiz or exam yields a maximum of 100 points. The total semester points Pts_total are computed as the weighted semester point average (each quiz points are weighted by 0.15, the final by 0.30, etc.), and from Pts_total the final grade is computed by the standard Jacobs formula.

Miniquiz makeup rules: if a miniquiz is missed without excuse, it will be graded with 0 points. An oral makeup will be offered for medically excused miniquizzes according to the Jacobs rules (especially, the medical excuse must be announced to me before the miniquiz). Non-medical excuses can be accepted on a case-by-case basis.

References (optional! the online lecture notes suffice)

  • Hopcroft, John E., Motwani, Rajeev, and Ullman, Jeffrey: Introduction to Automata Theory, 2nd (Addison-Wesley). The standard textbook for most parts of this lecture, except for the logic part.  IRC: QA267 .H56 2001
  • Schoening, Uwe: Logic for Computer Scientists (Progress in Computer Science and Applied Logic, Vol 8), (Birkhauser). The book contains what its title suggests. IRC: QA9 .S363 1989

Schedule (this will be filled in synchrony with reality as we go along)

Sep 4 Introduction
Sep 6 Basic notation. The concept of a formal language. Two kinds of infinities, one of them kind, the other a brute. (= Lecture notes Section 2) Exercise sheet 1
Sep 11 Deterministic Finite Automata (DFAs) and Nondeterministic Finite Automata (NFAs). Reading: LN Section 3 up to (including) Example 3.3.
Sep 13 Equivalence of DFAs and NFAs. Reading: LN Section 3 up to (excluding) Def. 3.7. Exercise sheet 2 Solutions to exercise sheet 1
Sep 18 no class (illness)
Sep 20 epsilon-NFAs, Moore and Mealy machines. Reading: LN Section 3.1 complete
Sep 25 Regular expressions and their equivalence with DFAs. Reading: LN Section 3.2 (we skip the material in 3.3) Note: due to no class on Sep 18, the exercise sheet #3 that was already displayed here will be replaced by an extended version covering two weeks.
Sep 27 Pumping Lemma and closure properties of regular languages. Reading: LN Sections 3.4, 3.5. Exercise sheet 3 (extended version, now covering 2 weeks)
Oct 2
Oct 4
Oct 9
Oct 11
Oct 16
Oct 18
Oct 25
Oct 30
Nov 1
Nov 6
Nov 8
Nov 13
Nov 15
Nov 20
Nov22
Nov 27
Nov 29
Dec 4
Dec 6