Aspects Algorithmiques de la Théorie des Beaux préordres / Algorithmic Aspects of WQO Theory (24h, 3 ECTS)

Où, quand ? / Where, when?: In 2022, the course takes place on Thursdays from 16h15 to 19h15, building Sophie Germain room 1002.

Poly / Lecture notes: can be found at this link Algorithmic Aspects of WQO Theory.

Prérequis / Prequisites: Elementary notions from logic (ordinals, ..), from complexity, and from recursion theory.

Intervenants / Lecturers: Jean Goubault-Larrecq goubault@lsv.fr (LMF, ENS Paris-Saclay, Université Paris-Saclay) Ph. Schnoebelen, phs@lsv.fr (LMF, ENS Paris-Saclay, Université Paris-Saclay & CNRS)

Responsable / In charge: Jean Goubault-Larrecq

Final Exam / Nov 24th: The text of the exam with some answers is available here.

Well-quasi-orderings, or WQOs, play a fundamental role in important results in several areas of computer science : formal language theory, rewriting, program verification, algorithmic graph theory, automated deduction, etc. and they are still intensively used nowadays (see e.g. Separability via Piecewise-Testable Languages by Goubault-Larrecq & Schmitz, or Ordinal-Recursive Complexity by Schmitz & Schnoebelen).

The objective of this course is to teach the basic notions of WQO Theory, motivated and illustrated by algorithmic applications in various areas.

1. 15 Sep. 2022 (J. Goubault-Larrecq): Introduction. Definition, a few characterizations of wqos. A library of well quasi-ordered data types: announcement, and proofs for the simplest cases. All the other cases will be seen in further lectures. Our first wqo: Dickson's Lemma. Application to coverability of WSTS, and of Petri nets in particular. The slides (with animations), and the short slides (without animations). Exercises for next time: 1.1, 1.2, 1.3, 1.22, 1.13, 1.14.

2. 22 Sep. 2022: Petri nets continued. Dickson's original application. Our second operation on wqos: Higman's Lemma. Applications: lossy channel systems. The slides (with animations), and the short slides (without animations). Exercises for next time: 1.6, 1.9, 1.29.

3. 29 Sep. 2022: Multisets, finite sets, Rado's counterexample. Van der Meyden's algorithm for satisfiability of disjunctive queries on indefinite databases. A quick word on parameterized complexity. Kruskal's theorem. Application to the termination of rewriting systems. The slides (with animations), and the short slides (without animations). Exercises for next time: 1.15, 1.5, 1.7, 1.8, 1.10, 1.11, 1.12. (Do not attempt to do the final subquestion of 1.8. Otherwise, look at the 2018 homework assignment and midterm exam, section 2, for inspiration.)

4. 06 Oct. 2022: Beyond trees: graph minors, and the Robertson and Seymour theorem (no proof). Applications to algorithmic graph theory. Beyond wqos: bqos, Noetherian spaces. Ideals and irreducible (downwards-)closed subsets. The slides (with animations), and the short slides (without animations).

The homework assignment for 2022, to be turned in by Thursday, October 20th, 2022, to Jean Goubault-Larrecq, in electronic form (LaTeX or scanned). No late submissions allowed. A possible solution.

5. 13 Oct. 2022 (Ph. Schnoebelen): Lossy counter machines and decidability (Sections 1.9 and 3.1). See also this paper. NB: Students not familiar with Presburger arithmetic will learn a lot by reading this recent survival guide.

6. 20 Oct. 2022: Verification of Lossy counter machines is hard! Existence of Büchi runs and boundedness are undecidable for LCMs (see this paper). Reachability and coverability are decidable for LCMs but these problems are Ackermann-hard (Sections 3.2—3.4).

People interested in playing with Ackermann's function can try to solve Project Euler's pb 282. If you don't know how to even start to solve this puzzle, you can get ideas by solving pb 188 (a simpler version) or you can ask me for tips in class and I'll be happy to help.

* take note: 27 Oct. 2022: Class cancelled.

* take note: 03 Nov. 2022: No class (midterm break).

7. 10 Nov. 2022: Complexity Upper Bounds for WSTS (Section 2): Normed wqos and controlled bad sequences. The Length Function Theorem for polynomials nwqos. NB: The Fast-Growing Complexity Hierarchy is described in this recent article.

8. 17 Nov. 2022: Exercise: let us compute L_g,ℕ²(2) assuming g(n)=n+1: this uses two heuristics that limit the search space. More generally, how can we compute with ideal-based representation of down sets (based on this paper).

9. 24 Nov. 2022: Final written exam. No documents allowed. The exam will take place in the usual room 1002, at the usual time, and will last 2 hours, from 16h15 to 18h15.

The evaluation is in two parts : a homework assignment serving as midterm exam, and a final written exam.

Here are a past homework assignment and a past final exam.