Automata and Formal Languages 2011/12

News | Dates | Grading | Content | Exercises | Exam | Material | Programming Assignment

Feb 15

The exam has been corrected and the results can be found in TUMonline now. The review ("Einsicht") will take place in 3.11.58 on Thursday (Feb 16) from 14:00 to 15:00.

Each grade (starting from 1.0 to 5.0) has been represented
1,2,3,5,2,4,3,5,3,4,4,6,0
times, respectively. Thus, 32 have passed, 10 have failed, 9 have not shown up. The exam is now online in the Exam section.

Feb 1

Please register for the oral part of the programming assignment here. It takes place in the room 3.11.58. Team members reserve one slot each (i.e. one per person) and one after another (i.e. people from the same team reserve successive slots).

Jan 30, 2012

Thanks to the students who observed that the complementation algorithm has not been corrected completely. The corrected version is now online, the first line has been moved to the fourth line. Due to this problem, the deadline for the assignment has been postponed to Friday. The oral examination will take place next week. This information will also be discussed on Wednesday during the lecture.

Jan 29, 2012

JE: Last set of slides added. It is identical to the set of last year, only with the slides numbered.

Jan 29, 2012

JE: Last set of slides added. It is identical to the set of last year, only with the slides numbered.

Jan 29, 2012

JE: Last set of slides added. It is identical to the set of last year, only with the slides numbered.

Jan 29, 2012

JE: Last set of slides added. It is identical to the set of last year, only with the slides numbered.

Jan 29, 2012

JE: The current version of the lecture notes is now the defnitive one. There have been important changes in the chapter on fixed-length languages, other changes have been minor. If you printed the original version of the notes, then I would recommend printing the current version of the chapter on fixed-length languages, and replacing the old one with it.

Jan 8, 2012

Results of the first part as well as points awarded are published in the programming section.

Jan 8, 2012

Two new sets of slides on automata on infinite words are available.

Jan 1, 2012

The testing results have been updated. Sorry for the misleading results on "input2" for the groups 24-40, I did not spot that the input file "input2" had been modified by the executable of the group 23.

Dec 22

Preliminary results of the first part are published in the programming section. Your programs have so far been tested on the two examples with the indicated results.

Dec 20

There is a "second deadline" for the first part of the programming assignement on Jan 3, but you can only receive 60% of points for this one. Further, if you want to reuse the first part of the project in the second part recall that the msbf encoding is used.

Dec 16

A preliminary version of the second part of the programming assignment is online now.

Dec 15

On Monday there will be exercises instead of the lecture. On Wednesday there will be tools demonstration. On Thursday there are no exercises.
You may upload your examples and share them for testing purposes using the following svn repository:
Username: afl-ws1112-stud39 Password: bjAv3hgj

Dec 14

A new example has been added to the programming section. The intersection example figure in the lecture notes has been updated.

Dec 12

JE: As explained in the lecture, the algorithm for complementation of fixed-length languages has a bug (it does not deal appropriately with the empty language). The bug has been fixed in the lecture notes. An example was discussed in the lecture. The slides have also been fixed.

Dec 7

JE: I have added the set of slides for Presburger arithmetic.

Dec 6

Programming assignment: The input is in the form of a graph just for your convenience. In fact, it can be displayed using dotty. Therefore, you can more easily run experiments on sample automata while having a visual check of your inputs.

Dec 5

An update of the programming assignment:
Since _all_ the operations are defined on languages of the same length, whenever two arguments of an operation have different lengths the shorter one needs to be padded by zeros on the left first.

Dec 5

Due to Dies academicus on Dec 8 the exercises do not take place.

November 28

JE: The lecture for December 7 is moved to December 2 (next Friday) at 11:30. I was just told that the lecture hall is needed on that day for the VHK-Forum (I was not even asked if I would not mind ...).

Nov 24

The programming assignment has been released, see the "Programming Assignment" section.

Nov 23

JE: There has been a minor change in the algorithm for intersection of fixed-length languages, and in the way fragments of the master automaton are encoded as tables.

Nov 10

JE: There were mistakes in the proof of Proposition 7.7 and in the algorithms for computing pol. They have been corrected. If you have a printed version of the lecture notes, I recommend to replace pages 127-130 with pages 127-130 of the current version.

Nov 4

JE: Jan has noticed a mistake in algorithm CSR in page 46 of the lecture notes. Line 1 was copypasted from algorithm LanPar, and this is wrong. The mistake has been corrected.

Nov 4

Note that some of the solutions and aditional homeworks appear in the Exercises tab.

Oct 31

JE: Philip Hoffmann has observed that the formulation in slide 37 of the set "Minimization" is ambiguous. I have changed the formulation to make it precise. (The lecture notes have not changed, this is only a problem of the slide)

Oct 26

JE: Due to a request I will number the slides from now on. I have already done so for the revised slides sets under Material.

Oct 17

The first exercise sessions takes place already on Thursday, Oct 20, at 12:30 and 16:00. You are invited to come to any of the exercises. If the distribution of the students is not very even, some limits shall be introduced.

Sep 28

Course information entered.

July 04

Creation of the website.