❗️ Previous year’s exam solved
- 23 Feb Lab 0 Introduction: examples & applicability
- 2 Mar, 9 Mar Lab 1 DFA accepter
- Lab 1' NFA, λ-NFA accepter
- 16 Mar, 23 Mar Lab 2 λ-NFA to NFA conversion
- Lab 3 NFA to DFA conversion
- 30 Mar, 6 Apr Lab 3' DFA minimization
- 27 Apr, 4 May Lab 4 CYK Parsing
- 11 May, 18 May Lab 5 CNF Conversion
The lab activity will consist of implementing 3 projects. You can chose the subject for each of them (choices listed below).
During the labs, we will discuss the projects and afterwards you will submit your solution (timetable listed below).
Evaluation: each project will receive a 1—10 grade, the final grade is their average. Exceptional project implementations can receive up to 12. Bonuses can be awarded for class work.
Note: I’ll be unavailable on 13 Apr and Easter break falls on 20 Apr.
For each project (P1, P2, P3) you can chose to implement any of the following:
Each project can get you a maximum grade indicated in the “Grade” column.
Programming languages: you can implement the projects in any language you want. I highly recommend C++ as it will also help you in your OOP course. Examples will be given in C++ as well.
Attendance: mandatory (at least for project submission). You can attent any lab in any week, just make sure to submit all of your projects.
Attendance, projects and grades: bit.ly/lab-lfa (Gr 134 & 135)
Stefan Niculae (Teaching Assistant) — [email protected]
Andrei Paun (Professor) — [email protected]