summaryrefslogtreecommitdiffstats
Commit message (Expand)AuthorAgeFilesLines
* Fix mistake in answer (thanks, Antoine Amarilli).David A. Madore2020-06-051-3/+3
* Clarify some answers.David A. Madore2020-06-041-4/+6
* Date.David A. Madore2020-06-041-1/+1
* Yet more tweaking.David A. Madore2020-06-041-0/+12
* Yet more questions.David A. Madore2020-06-041-0/+100
* Fix mistake.David A. Madore2020-06-041-1/+2
* More questions.David A. Madore2020-06-041-0/+284
* Minor changes.David A. Madore2020-06-041-6/+6
* More questions.David A. Madore2020-06-041-12/+382
* Test randomizer script: change uniformity rules.David A. Madore2020-06-041-30/+30
* Write a number of multiple-choice questions.David A. Madore2020-06-041-35/+256
* Start preparing multiple-choice test.David A. Madore2020-06-032-0/+450
* Typo.exam-20200123David A. Madore2020-02-231-1/+1
* Two typos (thanks, Pierre Pébereau).printed-2020David A. Madore2020-01-231-2/+2
* More re-reading.David A. Madore2020-01-211-1/+9
* Re-read test and answers.David A. Madore2020-01-211-63/+87
* Number of pages.David A. Madore2020-01-211-1/+1
* Clarification.David A. Madore2020-01-211-5/+6
* Write answer to exercise on CFGs.David A. Madore2020-01-211-5/+100
* Finish writing answers to exercise on unary languages.David A. Madore2020-01-211-11/+217
* Write answer to first exercise.David A. Madore2020-01-211-0/+40
* Front page.David A. Madore2020-01-211-3/+7
* Improve wording in various places.David A. Madore2020-01-211-9/+10
* Third exercise on CFGs.David A. Madore2020-01-211-0/+30
* Exercise on state elimination.David A. Madore2020-01-211-1/+31
* Update exercise on unary languages.David A. Madore2020-01-211-5/+39
* Start writing exam: an exercise on finite automata.David A. Madore2020-01-201-0/+174
* Add two exercises from last year's exam (plus, update index very slightly).printed-2019David A. Madore2019-10-221-2/+294
* Continue writing test.exam-20190328David A. Madore2019-03-261-13/+78
* Start writing an exam.David A. Madore2019-03-261-0/+193
* Take into account Antoine's remarks, but they may be too late.exam-20190205David A. Madore2019-02-031-26/+31
* Take into account Olivier's remarks on exam.David A. Madore2019-02-011-20/+25
* Prepare for printing.David A. Madore2019-01-311-11/+11
* Cursory proofreading.David A. Madore2019-01-311-7/+12
* Missing words (thanks, Michaël).David A. Madore2019-01-291-2/+2
* Write answers to exercise on CFGs.David A. Madore2019-01-281-8/+204
* Add an intermediate question to make exercise easier.David A. Madore2019-01-241-20/+25
* Add an exercise on CFGs.David A. Madore2019-01-241-1/+78
* Answers to exercise about computability.David A. Madore2019-01-231-0/+23
* Adopt convention of underlining the epsilon symbol in regexps.David A. Madore2019-01-231-10/+10
* A very silly exercise on computability.David A. Madore2019-01-231-0/+28
* Start writing exam: exercise on finite automata.David A. Madore2019-01-231-0/+372
* Typo (thanks, Antoine).David A. Madore2019-01-231-1/+1
* Minor clarifications about computability and universality.David A. Madore2019-01-161-27/+38
* Fix bijection between ℕ² and ℕ.David A. Madore2019-01-161-3/+3
* Various improvements to index.David A. Madore2019-01-071-25/+31
* Fix thinko.David A. Madore2018-12-101-2/+2
* Typos in slides.David A. Madore2018-10-171-2/+2
* Possible set of slides for first course.David A. Madore2018-10-161-0/+633
* Copy a lot of exercises into the course notes.printed-2018David A. Madore2018-10-031-2/+2586